Triangle-free strongly circular-perfect graphs
From MaRDI portal
Recommendations
- Circular-imperfection of triangle-free graphs
- scientific article; zbMATH DE number 5531989
- Circular perfect graphs
- Cycle-maximal triangle-free graphs
- scientific article; zbMATH DE number 1208712
- scientific article; zbMATH DE number 5917767
- Claw-free circular-perfect graphs
- Claw-free circular-perfect graphs
- scientific article; zbMATH DE number 3889565
- Cycles in triangle-free graphs
Cites work
- scientific article; zbMATH DE number 1455118 (Why is no real title available?)
- scientific article; zbMATH DE number 4183452 (Why is no real title available?)
- A class of facet producing graphs for vertex packing polyhedra
- A note on the star chromatic number
- Antiwebs are rank-perfect
- Applying Lehman's theorems to packing problems
- Circular perfect graphs
- Convex-round graphs are circular-perfect
- Geometric algorithms and combinatorial optimization
- Normal hypergraphs and the perfect graph conjecture
- On classes of minimal circular-imperfect graphs
- Star chromatic number
- The complexity of determining a shortest cycle of even length
- The strong perfect graph theorem
Cited in
(9)- Claw-free circular-perfect graphs
- On strongly circular-perfectness
- Circular-imperfection of triangle-free graphs
- Claw-free graphs with strongly perfect complements. Fractional and integral version. I: Basic graphs
- Computing the clique number of \(a\)-perfect graphs in polynomial time
- New results on minimal strongly imperfect graphs
- On the polynomial time computability of the circular-chromatic number for some superclasses of perfect graphs
- On circular-perfect graphs: a survey
- Computing clique and chromatic number of circular-perfect graphs in polynomial time
This page was built for publication: Triangle-free strongly circular-perfect graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1025560)
