Graph Isomorphism for Graph Classes Characterized by Two Forbidden Induced Subgraphs

DOI10.1007/978-3-642-34611-8_7zbMath1341.05168arXiv1208.0142OpenAlexW2964258525MaRDI QIDQ5200492

Pascal Schweitzer, Stefan Kratsch

Publication date: 6 November 2012

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1208.0142

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (10)

List coloring in the absence of two subgraphs ⋮ A complexity dichotomy and a new boundary class for the dominating set problem ⋮ Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs ⋮ On the isomorphism of graphs having some eigenvalues of moderate multiplicity ⋮ Bounding clique-width via perfect graphs ⋮ Towards an isomorphism dichotomy for hereditary graph classes ⋮ Induced minor free graphs: isomorphism and clique-width ⋮ Bounding the clique-width of \(H\)-free split graphs ⋮ Bounding the clique-width of \(H\)-free split graphs ⋮ Graph isomorphism restricted by lists

This page was built for publication: Graph Isomorphism for Graph Classes Characterized by Two Forbidden Induced Subgraphs