Isomorphism on Subgraph-Closed Graph Classes: A Complexity Dichotomy and Intermediate Graph Classes

From MaRDI portal

Revision as of 19:27, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2872076

Jump to:navigation, search

DOI10.1007/978-3-642-45030-3_11zbMath1321.05163OpenAlexW88519367MaRDI QIDQ2872076

Pascal Schweitzer, Yota Otachi

Publication date: 14 January 2014

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-45030-3_11

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (3)

Towards an isomorphism dichotomy for hereditary graph classes ⋮ Induced minor free graphs: isomorphism and clique-width ⋮ Graph isomorphism restricted by lists

This page was built for publication: Isomorphism on Subgraph-Closed Graph Classes: A Complexity Dichotomy and Intermediate Graph Classes

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2872076&oldid=15815732"