On circular critical graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3121699 (Why is no real title available?)
- scientific article; zbMATH DE number 3489047 (Why is no real title available?)
- A characterization of perfect graphs
- Coloring a Family of Circular Arcs
- Combinatorial designs related to the strong perfect graph conjecture
- Perfect zero–one matrices
Cited in
(16)- Two conjectures equivalent to the perfect graph conjecture
- The strong perfect graph conjecture: 40 years of attempts, and its resolution
- An approach to solving \(A^{k}=J-I\)
- \(g\)-circulant solutions to the (0,1) matrix equation \(A^m=J_n\)
- Cayley partitionable graphs and near-factorizations of finite groups
- Convex-round graphs are circular-perfect
- On CIS circulants
- An analogue of Dirac's theorem on circular super-critical graphs
- On Moore bipartite digraphs
- Grinstead's conjecture is true for graphs with a small clique number
- scientific article; zbMATH DE number 3970805 (Why is no real title available?)
- On circulant thin Lehman matrices
- Thin Lehman matrices arising from finite groups
- On circulant thin Lehman matrices
- Some results on circular perfect graphs and perfect graphs
- Properties of an approximability-related parameter on circular complete graphs
This page was built for publication: On circular critical graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q796546)
