Results 181 to 190 of about 3,384,024 (197)
Some of the next articles are maybe not open access.
Long induced paths in sparse graphs and graphs with forbidden patterns
arXiv.orgConsider a graph $G$ with a path $P$ of order $n$. What conditions force $G$ to also have a long induced path? As complete bipartite graphs have long paths but no long induced paths, a natural restriction is to forbid some fixed complete bipartite graph $
Julien Duron +2 more
semanticscholar +1 more source
Complexity of Coloring Graphs without Forbidden Induced Subgraphs
2001We give a complete characterization of parameter graphs H for which the problem of coloring H-free graphs is polynomial and for which it is NP-complete. We further initiate a study of this problem for two forbidden subgraphs.
Král, D. +3 more
openaire +1 more source
Forbidden induced subgraph characterization of circle graphs within split graphs
Discrete Applied Mathematics, 2022Nina Pardal +2 more
exaly
Automated generation of conjectures on forbidden subgraph characterization
Discrete Applied Mathematics, 2014Alain Hertz +2 more
exaly
Forbidden induced subgraphs for bounded p-intersection number
Discrete Mathematics, 2016Dieter Rautenbach, Jayme L Szwarcfiter
exaly
Some forbidden subgraph conditions for a graph to have a k-contractible edge
Discrete Mathematics, 2003Kiyoshi Ando
exaly