Even-hole-free graphs. I: Decomposition theorem
From MaRDI portal
Recommendations
- Even-hole-free graphs: A survey
- Some remarks on even-hole-free graphs
- Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences
- On the structure of (even hole, kite)-free graphs
- Even-hole-free graphs part II: Recognition algorithm
- On the structure of (pan, even hole)-free graphs
- Decomposition of even-hole-free graphs with star cutsets and 2-joins
- Induced subgraphs and tree decompositions. I: Even-hole-free graphs of bounded degree
- On the tree-width of even-hole-free graphs
- Tree decompositions of graphs without large bipartite holes
Cites work
- -perfect graphs
- A theorem of Truemper
- Alpha-balanced graphs and matrices and GF(3)-representability of matroids
- Balanced \(0,\pm 1\) matrices. I: Decomposition
- Compositions for perfect graphs
- Decomposition of balanced matrices
- Even and odd holes in cap-free graphs
- scientific article; zbMATH DE number 3878985 (Why is no real title available?)
- scientific article; zbMATH DE number 1496606 (Why is no real title available?)
- scientific article; zbMATH DE number 854567 (Why is no real title available?)
- On the complexity of testing for odd holes and induced odd paths
- Star-cutsets and perfect graphs
Cited in
(45)- Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences
- The strong perfect graph conjecture: 40 years of attempts, and its resolution
- Square-free perfect graphs.
- Automated conjecturing. III. Property-relations conjectures
- On the structure of (even hole, kite)-free graphs
- Decomposition of odd-hole-free graphs by double star cutsets and 2-joins
- Decomposition of even-hole-free graphs with star cutsets and 2-joins
- Detecting a long even hole
- Induced subgraphs and tree decompositions. I: Even-hole-free graphs of bounded degree
- The (theta, wheel)-free graphs. I: Only-prism and only-pyramid graphs
- The (theta, wheel)-free graphs. II: Structure theorem
- On the complexity of finding chordless paths in bipartite graphs and some interval operators in graphs and hypergraphs
- A faster algorithm to recognize even-hole-free graphs
- Coloring graphs with no even hole \(\geqslant 6\): the triangle-free case
- Detecting 2-joins faster
- Vertex elimination orderings for hereditary graph classes
- A polynomial recognition algorithm for balanced matrices
- A note on coloring \((4K_1, C_4, C_6)\)-free graphs with a \(C_7\)
- Forbidding holes and antiholes
- Reconfiguration of vertex covers in a graph
- Graphs of separability at most two: structural characterizations and their consequences
- Even-hole-free graphs part II: Recognition algorithm
- Even-hole-free planar graphs have bounded treewidth
- The Induced Disjoint Paths Problem
- Graphs of separability at most 2
- Complexity of independent set reconfigurability problems
- On the structure of (pan, even hole)-free graphs
- Even-hole-free graphs: A survey
- A generalization of join and an algorithmic recognition problem
- Hereditary efficiently dominatable graphs
- A faster algorithm to recognize even-hole-free graphs
- Even-hole-free graphs still have bisimplicial vertices
- Finding a shortest even hole in polynomial time
- On the structure and clique‐width of (4K1,C4,C6,C7)‐free graphs
- Graphs with no induced house nor induced hole have the de Bruijn–Erdös property
- Coloring (4K₁,C₄,C₆)-free graphs
- Algorithms for finding an induced cycle in planar graphs
- Blazing a trail via matrix multiplications: a faster algorithm for non-shortest induced paths
- Improved algorithms for perfect graphs and odd holes
- (Even hole, triangle)-free graphs revisited
- Stable sets and graphs with no even holes
- Induced packing of odd cycles in planar graphs
- Combinatorial optimization with 2-joins
- Triangulated neighborhoods in even-hole-free graphs
- Bisimplicial vertices in even-hole-free graphs
This page was built for publication: Even-hole-free graphs. I: Decomposition theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2778281)
