Subgraph Isomorphism on Graph Classes that Exclude a Substructure

H.L. Bodlaender, Tesshu Hanaka, Yoshio Okamoto, Yota Otachi, Tom van der Zanden

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingAcademicpeer-review

32 Downloads (Pure)

Abstract

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 the path of five vertices. We then also consider the general case of possibly disconnected forbidden minors. We show in particular that: the problem is fixed-parameter tractable parameterized by the size of the forbidden minor h when h is a linear forest such that at most one component has four vertices and all other components have three or less vertices; and it is np-complete if h contains four or more components with at least five vertices each. 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.keywordssubgraph isomorphismminor free graphsparameterized complexity.
Original languageEnglish
Title of host publicationAlgorithms and Complexity
Subtitle of host publication11th International Conference, CIAC 2019, Rome, Italy, May 27–29, 2019, Proceedings
EditorsPinar Heggernes
PublisherSpringer, Cham
Pages87-98
ISBN (Electronic)978-3-030-17402-6
ISBN (Print)978-3-030-17401-9
DOIs
Publication statusPublished - 2019

Publication series

SeriesLecture Notes in Computer Science
Volume11485
ISSN0302-9743
SeriesTheoretcial Computer Science and General Issues (LNTCS)
Volume11485

Keywords

  • Subgraph isomorphism
  • minor free graphs
  • parameterized complexity

Cite this