Even-hole-free graphs part II: Recognition algorithm
From MaRDI portal
Recommendations
- A faster algorithm to recognize even-hole-free graphs
- A faster algorithm to recognize even-hole-free graphs
- Even-hole-free graphs: A survey
- Some remarks on even-hole-free graphs
- Even-hole-free graphs. I: Decomposition theorem
- Structure and algorithms for (cap, even hole)-free graphs
- Odd Hole Recognition in Graphs of Bounded Clique Size
- On the structure of (even hole, kite)-free graphs
- Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences
- On the structure of (pan, even hole)-free graphs
Cites work
- -perfect graphs
- Balanced \(0,\pm 1\) matrices. I: Decomposition
- Compositions for perfect graphs
- Decomposition of balanced matrices
- Even and odd holes in cap-free graphs
- Even-hole-free graphs. I: Decomposition theorem
- On the complexity of testing for odd holes and induced odd paths
- Star-cutsets and perfect graphs
Cited in
(51)- 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
- Finding large holes
- Structure and algorithms for (cap, even hole)-free graphs
- On the structure of (even hole, kite)-free graphs
- The sandwich problem for decompositions and almost monotone properties
- 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
- Polyhedral properties of the induced cluster subgraphs
- Detecting a long even hole
- Induced subgraphs and tree decompositions. I: Even-hole-free graphs of bounded degree
- On the complexity of finding chordless paths in bipartite graphs and some interval operators in graphs and hypergraphs
- Some completion problems for graphs without chordless cycles of prescribed lengths
- A faster algorithm to recognize even-hole-free graphs
- Coloring graphs with no even hole \(\geqslant 6\): the triangle-free case
- One-three join: a graph operation and its consequences
- Detecting 2-joins faster
- Decomposing Berge graphs and detecting balanced skew partitions
- 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
- Even-hole-free graphs. I: Decomposition theorem
- Shortest Paths between Shortest Paths and Independent Sets
- The Induced Disjoint Paths Problem
- Complexity of independent set reconfigurability problems
- On the structure of (pan, even hole)-free graphs
- On the structure of (banner, odd hole)-free graphs
- Detecting even holes
- Even-hole-free graphs: A survey
- A generalization of join and an algorithmic recognition problem
- Finding a Shortest Odd Hole
- Separation choosability and dense bipartite induced subgraphs
- Odd Hole Recognition in Graphs of Bounded Clique Size
- 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
- Coloring (4K₁,C₄,C₆)-free graphs
- On the forbidden induced subgraph sandwich problem
- Algorithms for finding an induced cycle in planar graphs
- Shortest odd paths in undirected graphs with conservative weight functions
- Graphs with no even holes and no sector wheels are the union of two chordal graphs
- Blazing a trail via matrix multiplications: a faster algorithm for non-shortest induced paths
- The sandwich problem for odd-hole-free and even-hole-free graphs
- 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 part II: Recognition algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3150171)
