On classes of minimal circular-imperfect graphs
From MaRDI portal
Publication:2482095
Recommendations
Cites work
- scientific article; zbMATH DE number 1455118 (Why is no real title available?)
- scientific article; zbMATH DE number 2151259 (Why is no real title available?)
- scientific article; zbMATH DE number 2170470 (Why is no real title available?)
- scientific article; zbMATH DE number 4183452 (Why is no real title available?)
- A characterization of perfect graphs
- 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 chromatic number: A survey
- Circular perfect graphs
- Graphical properties related to minimal imperfection
- Minimal circular-imperfect graphs of large clique number and large independence number
- Minimally circular-imperfect graphs with a major vertex
- On certain polytopes associated with graphs
- Perfect zero–one matrices
- Star chromatic number
- Sur le coloriage des graphs
- The ellipsoid method and its consequences in combinatorial optimization
- The strong perfect graph theorem
Cited in
(12)- Claw-free circular-perfect graphs
- Triangle-free strongly circular-perfect graphs
- On circular critical graphs
- Circular-imperfection of triangle-free graphs
- Some aspects of minimal imperfect graphs
- Minimal circular-imperfect graphs of large clique number and large independence number
- A circle criterion for a generalized cross graph in terms of minimal excluded minors
- Grinstead's conjecture is true for graphs with a small clique number
- Claw-free circular-perfect graphs
- On circular-perfect graphs: a survey
- On minimally circular-imperfect graphs
- Computing clique and chromatic number of circular-perfect graphs in polynomial time
This page was built for publication: On classes of minimal circular-imperfect graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2482095)
