scientific article; zbMATH DE number 7053353
From MaRDI portal
zbMath1423.05129MaRDI QIDQ5743476
Publication date: 10 May 2019
Full work available at URL: https://dl.acm.org/citation.cfm?id=2095217
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms (68W40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
Coloring graphs with no even hole \(\geqslant 6\): the triangle-free case, On the structure of (even hole, kite)-free graphs, A faster algorithm to recognize even-hole-free graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The three-in-a-tree problem
- Algorithms for finding an induced cycle in planar graphs
- Combinatorial optimization with 2-joins
- The strong perfect graph theorem
- Detecting holes and antiholes in graphs
- Triangulated neighborhoods in even-hole-free graphs
- Bisimplicial vertices in even-hole-free graphs
- Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences
- On diameters and radii of bridged graphs
- Recognizing claw-free perfect graphs
- Star-cutsets and perfect graphs
- On the complexity of testing for odd holes and induced odd paths
- Recognizing bull-free perfect graphs
- Decomposition of even-hole-free graphs with star cutsets and 2-joins
- Detecting 2-joins faster
- Finding a smallest odd hole in a claw-free graph using global structure
- Recognizing Berge graphs
- Even-hole-free graphs part I: Decomposition theorem
- Recognizing Dart-Free Perfect Graphs
- Even-hole-free graphs part II: Recognition algorithm
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Detecting a Theta or a Prism
- Even-hole-free planar graphs have bounded treewidth
- Algorithmic Aspects of Vertex Elimination on Graphs
- Even and odd holes in cap-free graphs
- Detecting even holes
- Even-hole-free graphs: A survey
- The NP-completeness column
- Algorithms for Perfectly Contractile Graphs
- Odd Hole Recognition in Graphs of Bounded Clique Size
- Smallest Odd Holes in Claw-Free Graphs (Extended Abstract)
