On circular-perfect graphs: a survey
From MaRDI portal
Publication:2225429
Recommendations
- Some results on circular perfect graphs and perfect graphs
- On minimally circular-imperfect graphs
- scientific article; zbMATH DE number 5531989
- Circular perfect graphs
- scientific article; zbMATH DE number 2151259
- A survey on undirected circulant graphs
- On classes of minimal circular-imperfect graphs
- scientific article; zbMATH DE number 2085001
- Circular-Perfect Concave-Round Graphs
- Structural results on circular-arc graphs and circle graphs: a survey and the main open problems
Cites work
- A characterization of perfect graphs
- A note on the star chromatic number
- Anti-blocking polyhedra
- Antiwebs are rank-perfect
- Applying Lehman's theorems to packing problems
- Beyond perfection: computational results for superclasses
- Blocking and anti-blocking pairs of polyhedra
- Circular chromatic number: A survey
- Circular perfect graphs
- Circular-imperfection of triangle-free graphs
- Claw-free circular-perfect graphs
- Computing clique and chromatic number of circular-perfect graphs in polynomial time
- Computing the clique number of \(a\)-perfect graphs in polynomial time
- Convex-round graphs are circular-perfect
- Density of the circular chromatic numbers of series-parallel graphs
- Geometric algorithms and combinatorial optimization
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- 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 969115 (Why is no real title available?)
- scientific article; zbMATH DE number 4183452 (Why is no real title available?)
- Minimal circular-imperfect graphs of large clique number and large independence number
- Normal hypergraphs and the perfect graph conjecture
- On certain polytopes associated with graphs
- On classes of minimal circular-imperfect graphs
- On minimally circular-imperfect graphs
- On rank-perfect subclasses of near-bipartite graphs
- On the Shannon capacity of a graph
- On the theta number of powers of cycle graphs
- Perfect zero–one matrices
- Polynomial time computability of some graph parameters for superclasses of perfect graphs
- Recent developments in circular colouring of graphs
- Reducibility among combinatorial problems
- Some results on circular perfect graphs and perfect graphs
- Star chromatic number
- Star chromatic numbers and products of graphs
- Sur le coloriage des graphs
- The ellipsoid method and its consequences in combinatorial optimization
- The strong perfect graph theorem
- Three classes of minimal circular-imperfect graphs
- Topics on perfect graphs
- Triangle-free strongly circular-perfect graphs
Cited in
(11)- Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs
- Structural results on circular-arc graphs and circle graphs: a survey and the main open problems
- scientific article; zbMATH DE number 5531989 (Why is no real title available?)
- Computing clique and chromatic number of circular-perfect graphs in polynomial time
- scientific article; zbMATH DE number 2151259 (Why is no real title available?)
- Circular perfect graphs
- On the Circular Area Signature for Graphs
- Boundedness for proper conflict-free and odd colorings
- Improved algorithms for perfect graphs and odd holes
- Higher-dimensional generalization of Youngs' theorem and circular colorings
- On defining numbers of circular complete graphs
This page was built for publication: On circular-perfect graphs: a survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2225429)
