On Switching to H-Free Graphs

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F14%3A10282427" target="_blank" >RIV/00216208:11320/14:10282427 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1002/jgt.21745" target="_blank" >http://dx.doi.org/10.1002/jgt.21745</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1002/jgt.21745" target="_blank" >10.1002/jgt.21745</a>

Result language
angličtina
Original language name
On Switching to H-Free Graphs
Original language description
In this article, we study the problem of deciding if, for a fixed graph H, a given graph is switching equivalent to an H-free graph. Polynomial-time algorithms are known for H having at most three vertices or isomorphic to P-4. We show that for H isomorphic to a claw, the problem is polynomial, too. On the other hand, we give infinitely many graphs H such that the problem is NP-complete, thus solving an open problem [Kratochvil, Neetil and Zyka, Ann Discrete Math 51 (1992)]. Further, we give a characterization of graphs switching equivalent to a K-1,K- 2-free graph by ten forbidden-induced subgraphs, each having five vertices. We also give the forbidden-induced subgraphs for graphs switching equivalent to a forest of bounded vertex degrees.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—

Project
<a href="/en/project/GBP202%2F12%2FG061" target="_blank" >GBP202/12/G061: Center of excellence - Institute for theoretical computer science (CE-ITI)</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2014
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)