Recommendations
- Some remarks on even-hole-free graphs
- Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences
- Even-hole-free graphs. I: Decomposition theorem
- On the structure of (even hole, kite)-free graphs
- On the structure of (pan, even hole)-free graphs
- Even-hole-free graphs part II: Recognition algorithm
- On the tree-width of even-hole-free graphs
- Even and odd holes in cap-free graphs
- Structure and algorithms for (cap, even hole)-free graphs
- On the structure of (banner, odd hole)-free graphs
Cited in
(30)- Even-hole-free graphs still have bisimplicial vertices
- Independent set reconfiguration in cographs and their generalizations
- Finding a shortest even hole in polynomial time
- Counting perfect matchings and the switch chain
- Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds
- Structure and algorithms for (cap, even hole)-free graphs
- Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey
- Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences
- Negative (and positive) circles in signed graphs: a problem collection
- scientific article; zbMATH DE number 1496606 (Why is no real title available?)
- (Theta, triangle)‐free and (even hole, K4)‐free graphs—Part 1: Layered wheels
- Graphs with no even holes and no sector wheels are the union of two chordal graphs
- On the tree-width of even-hole-free graphs
- A faster algorithm to recognize even-hole-free graphs
- Open problems on graph coloring for special graph classes
- On the connectivity and diameter of geodetic graphs
- Forbidding holes and antiholes
- Unavoidable induced subgraphs in graphs with complete bipartite induced minors
- Induced subgraphs and tree decompositions. I: Even-hole-free graphs of bounded degree
- Forbidden induced subgraphs
- Even-hole-free graphs. I: Decomposition theorem
- On the structure of perfectly divisible graphs
- Improved algorithms for perfect graphs and odd holes
- On the structure of (pan, even hole)-free graphs
- A note on chromatic number of (cap, even hole)-free graphs
- A faster algorithm to recognize even-hole-free graphs
- A better upper bound on the chromatic number of (cap, even-hole)-free graphs
- Bisimplicial vertices in even-hole-free graphs
- Vertex elimination orderings for hereditary graph classes
- Even-hole-free graphs part II: Recognition algorithm
This page was built for publication: Even-hole-free graphs: A survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4899861)
