On circular critical graphs
From MaRDI portal
Publication:796546
DOI10.1016/0012-365X(84)90019-0zbMATH Open0544.05028OpenAlexW2066125721MaRDI QIDQ796546FDOQ796546
Publication date: 1984
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(84)90019-0
Recommendations
Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
Cited In (16)
- An approach to solving \(A^{k}=J-I\)
- Title not available (Why is that?)
- Cayley partitionable graphs and near-factorizations of finite groups
- Two conjectures equivalent to the perfect graph conjecture
- \(g\)-circulant solutions to the (0,1) matrix equation \(A^m=J_n\)
- An analogue of Dirac's theorem on circular super-critical graphs
- Grinstead's conjecture is true for graphs with a small clique number
- Convex-round graphs are circular-perfect
- On CIS circulants
- On circulant thin Lehman matrices
- On circulant thin Lehman matrices
- The strong perfect graph conjecture: 40 years of attempts, and its resolution
- Some results on circular perfect graphs and perfect graphs
- Thin Lehman matrices arising from finite groups
- On Moore bipartite digraphs
- 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)
