Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences
From MaRDI portal
(Redirected from Publication:1026014)
Recommendations
Cites work
- scientific article; zbMATH DE number 4183452 (Why is no real title available?)
- A class of -perfect graphs
- Alpha-balanced graphs and matrices and GF(3)-representability of matroids
- Bisimplicial vertices in even-hole-free graphs
- Characterizations of derived graphs
- Conditions for β-perfectness
- Even and odd holes in cap-free graphs
- Even pairs
- Even-hole-free graphs part II: Recognition algorithm
- Even-hole-free graphs. I: Decomposition theorem
- Graph Theory and Probability
- On diameters and radii of bridged graphs
- The chromatic number of graphs which induce neither \(K_{1,3}\) nor \(K_ 5-e\)
- The strong perfect graph theorem
- Triangulated neighborhoods in even-hole-free graphs
- Vertex colouring and forbidden subgraphs -- a survey
- -perfect graphs
Cited in
(36)- Even-hole-free graphs still have bisimplicial vertices
- Even-hole-free graphs: A survey
- Structural domination and coloring of some \(( P_7 , C_7)\)-free graphs
- Tree independence number. I. (Even hole, diamond, pyramid)-free graphs
- The (theta, wheel)-free graphs. I: Only-prism and only-pyramid graphs
- Finding a shortest even hole in polynomial time
- On the structure of (banner, odd hole)-free graphs
- Graphs of separability at most 2
- On the structure of (even hole, kite)-free graphs
- Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds
- Induced subgraphs and tree decompositions. IV: (Even hole, diamond, pyramid)-free graphs
- Strong cliques in diamond-free graphs
- A proof of Hougardy's conjecture for diamond-free graphs
- Decomposing and clique-coloring (diamond, odd-hole)-free graphs
- Structure and algorithms for (cap, even hole)-free graphs
- Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey
- Triangulated neighborhoods in even-hole-free graphs
- On the chromatic number of (\(P_6\), diamond)-free graphs
- Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences
- Weight choosability of graphs with maximum degree 4
- Colouring diamond-free graphs
- On rank-width of (diamond, even-hole)-free graphs
- Two classes of \(\beta \)-perfect graphs that do not necessarily have simplicial extremes
- Graphs of separability at most two: structural characterizations and their consequences
- A faster algorithm to recognize even-hole-free graphs
- Vizing bound for the chromatic number on some graph classes
- Perfectly contractile diamond-free graphs
- Even-hole-free graphs. I: Decomposition theorem
- Linear χ -binding functions for some classes of ( P 3 ∪ P 2 )-free graphs
- On the forbidden induced subgraph sandwich problem
- Hereditary efficiently dominatable graphs
- Combinatorial optimization with 2-joins
- On the structure of (pan, even hole)-free graphs
- A note on chromatic number of (cap, even hole)-free graphs
- A faster algorithm to recognize even-hole-free graphs
- Even-hole-free graphs part II: Recognition algorithm
This page was built for publication: Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1026014)
