Subgraph Isomorphism on Graph Classes that Exclude a Substructure

by   Hans L. Bodlaender, et al.
Kyoto University
Utrecht University
Kumamoto University
University of Electro-Communications

We study Subgraph Isomorphism on graph classes defined by a fixed forbidden graph. Although there are several ways for forbidding a graph, we observe that it is reasonable to focus on the minor relation since other well-known relations lead to either trivial or equivalent problems. When the forbidden minor is connected, we present a near dichotomy of the complexity of Subgraph Isomorphism with respect to the forbidden minor, where the only unsettled case is P_5, the path of five vertices. We then also consider the general case of possibly disconnected forbidden minors. We show fixed-parameter tractable cases and randomized XP-time solvable cases parameterized by the size of the forbidden minor H. We also show that by slightly generalizing the tractable cases, the problem becomes NP-complete. All unsettle cases are equivalent to P_5 or the disjoint union of two P_5's. As a byproduct, we show that Subgraph Isomorphism is fixed-parameter tractable parameterized by vertex integrity. Using similar techniques, we also observe that Subgraph Isomorphism is fixed-parameter tractable parameterized by neighborhood diversity.


page 1

page 2

page 3

page 4


Model Checking Disjoint-Paths Logic on Topological-Minor-Free Graph Classes

Disjoint-paths logic, denoted 𝖥𝖮+𝖣𝖯, extends first-order logic (𝖥𝖮) with...

Computing Densest k-Subgraph with Structural Parameters

Densest k-Subgraph is the problem to find a vertex subset S of size k su...

Fixed-parameter tractability of Graph Isomorphism in graphs with an excluded minor

We prove that Graph Isomorphism and Canonization in graphs excluding a f...

Excluding a ladder

Which graph classes C exclude a fixed ladder as a minor? We show that th...

Counting and Finding Homomorphisms is Universal for Parameterized Complexity Theory

Counting homomorphisms from a graph H into another graph G is a fundamen...

Can Romeo and Juliet Meet? Or Rendezvous Games with Adversaries on Graphs

We introduce the rendezvous game with adversaries. In this game, two pla...

Multi-Parameter Analysis of Finding Minors and Subgraphs in Edge Periodic Temporal Graphs

We study the computational complexity of determining structural properti...

Please sign up or login with your details

Forgot password? Click here to reset