Towards an Isomorphism Dichotomy for Hereditary Graph Classes

DOI10.4230/LIPIcs.STACS.2015.689zbMath1355.68130arXiv1411.1977OpenAlexW2747693043MaRDI QIDQ2955034

Pascal Schweitzer

Publication date: 24 January 2017

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

zbMATH Keywords

reductionsforbidden induced subgraphsmodular decompositiongraph isomorphismbounded color valence

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (8)

Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs ⋮ 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 ⋮ Critical hereditary graph classes: a survey ⋮ Bounding the clique-width of \(H\)-free split graphs ⋮ Graph isomorphism restricted by lists

This page was built for publication: Towards an Isomorphism Dichotomy for Hereditary Graph Classes