Even-hole-free graphs: A survey
DOI10.2298/AADM100812027VzbMATH Open1265.05518WikidataQ59903197 ScholiaQ59903197MaRDI QIDQ4899861FDOQ4899861
Authors: Kristina Vušković 
Publication date: 10 January 2013
Published in: Applicable Analysis and Discrete Mathematics (Search for Journal in Brave)
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
combinatorial optimizationperfect graphseven-hole-free graphsstrong perfect graph conjecturepolynomial time recognition
Graph algorithms (graph-theoretic aspects) (05C85) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Structural characterization of families of graphs (05C75) Perfect graphs (05C17)
Cited In (27)
- Independent set reconfiguration in cographs and their generalizations
- Finding a shortest even hole in polynomial time
- 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
- On the structure of (pan, even hole)‐free graphs
- Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences
- Title not available (Why is that?)
- (Theta, triangle)‐free and (even hole, K4)‐free graphs—Part 1: Layered wheels
- Negative (and positive) circles in signed graphs: a problem collection
- 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
- On the connectivity and diameter of geodetic graphs
- Forbidding holes and antiholes
- Induced subgraphs and tree decompositions. I: Even-hole-free graphs of bounded degree
- Forbidden induced subgraphs
- Even-hole-free graphs. I: Decomposition theorem
- Open Problems on Graph Coloring for Special Graph Classes
- Counting Perfect Matchings and the Switch Chain
- A faster algorithm to recognize even-hole-free graphs
- A note on chromatic number of (cap, even hole)-free graphs
- Title not available (Why is that?)
- A better upper bound on the chromatic number of (cap, even-hole)-free graphs
- Bisimplicial vertices in even-hole-free graphs
- Even-hole-free graphs part II: Recognition algorithm
- Vertex elimination orderings for hereditary graph classes
- Even-hole-free graphs still have bisimplicial vertices
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)
