On the Complexity of Reconstructing H-free Graphs from Their Star Systems

DOI10.1007/978-3-540-78773-0_17zbMath1136.68459OpenAlexW1565016281WikidataQ60488745 ScholiaQ60488745MaRDI QIDQ5458528

Federico Mancini, Fedor V. Fomin, Jan Kratochvíl, Jan Arne Telle, Daniel Lokshtanov

Publication date: 15 April 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-78773-0_17

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Related Items

On the complexity of reconstructing H-free graphs from their Star Systems

Cites Work

• Towards a dichotomy theorem for the counting constraint satisfaction problem
• Le problème d'étoiles pour graphes est NP-complèt
• Complement reducible graphs
• Realizability and uniqueness in graphs
• Isomorphism Testing and Symmetry of Graphs
• Some NP-Complete Problems Similar to Graph Isomorphism
• Reconstructing a Graph from its Neighborhood Lists
• Neighborhood hypergraphs of bipartite graphs
• Unnamed Item
• Unnamed Item