The following pages link to Even-hole-free graphs: A survey (Q4899861):
Displaying 27 items.
- Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences (Q412344) (← links)
- Bisimplicial vertices in even-hole-free graphs (Q958679) (← links)
- Negative (and positive) circles in signed graphs: a problem collection (Q1643910) (← links)
- Structure and algorithms for (cap, even hole)-free graphs (Q1685999) (← links)
- A note on chromatic number of (cap, even hole)-free graphs (Q1712540) (← links)
- Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey (Q1733849) (← links)
- On the tree-width of even-hole-free graphs (Q1979431) (← links)
- A better upper bound on the chromatic number of (cap, even-hole)-free graphs (Q1981707) (← links)
- Induced subgraphs and tree decompositions. I: Even-hole-free graphs of bounded degree (Q2171016) (← links)
- Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds (Q2341752) (← links)
- A faster algorithm to recognize even-hole-free graphs (Q2347846) (← links)
- Forbidden induced subgraphs (Q2413330) (← links)
- Vertex elimination orderings for hereditary graph classes (Q2514166) (← links)
- Forbidding holes and antiholes (Q2758335) (← links)
- Even-hole-free graphs. I: Decomposition theorem (Q2778281) (← links)
- Independent set reconfiguration in cographs and their generalizations (Q2825488) (← links)
- Open Problems on Graph Coloring for Special Graph Classes (Q2827799) (← links)
- Even-hole-free graphs part II: Recognition algorithm (Q3150171) (← links)
- (Q4500707) (← links)
- On the structure of (pan, even hole)‐free graphs (Q4604020) (← links)
- Counting Perfect Matchings and the Switch Chain (Q5232145) (← links)
- (Q5743476) (← links)
- Even-hole-free graphs still have bisimplicial vertices (Q6038593) (← links)
- Finding a shortest even hole in polynomial time (Q6057650) (← links)
- (Theta, triangle)‐free and (even hole, K4)‐free graphs—Part 1: Layered wheels (Q6080861) (← links)
- On the connectivity and diameter of geodetic graphs (Q6189693) (← links)
- Graphs with no even holes and no sector wheels are the union of two chordal graphs (Q6612305) (← links)
