Bisimplicial vertices in even-hole-free graphs
From MaRDI portal
Publication:958679
DOI10.1016/j.jctb.2007.12.006zbMath1205.05119OpenAlexW2022783208MaRDI QIDQ958679
Louigi Addario-Berry, Frédéric Havet, Maria Chudnovsky, P. D. Seymour, Bruce A. Reed
Publication date: 8 December 2008
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2007.12.006
Related Items
Coloring graphs with no even hole \(\geqslant 6\): the triangle-free case, Triangulated neighborhoods in even-hole-free graphs, Induced subgraphs and tree decompositions. I: Even-hole-free graphs of bounded degree, On the chromatic number of (\(P_6\), diamond)-free graphs, Even-hole-free graphs still have bisimplicial vertices, Structure and algorithms for (cap, even hole)-free graphs, Finding a shortest even hole in polynomial time, An optimal χ‐bound for (P6, diamond)‐free graphs, Even-hole-free planar graphs have bounded treewidth, Some problems on induced subgraphs, Algorithms for induced biclique optimization problems, On the structure of (pan, even hole)‐free graphs, A note on chromatic number of (cap, even hole)-free graphs, Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey, A better upper bound on the chromatic number of (cap, even-hole)-free graphs, Corrigendum to: ``Bisimplicial vertices in even-hole-free graphs, Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors, On the structure of (even hole, kite)-free graphs, Bounding χ in terms of ω and Δ for quasi-line graphs, Induced subgraphs of graphs with large chromatic number. IV: Consecutive holes, Vertex elimination orderings for hereditary graph classes, The intersection of two vertex coloring problems, Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences, Square-Free Graphs with No Six-Vertex Induced Path, Unnamed Item, A faster algorithm to recognize even-hole-free graphs
Cites Work
