On circular critical graphs
From MaRDI portal
Publication:796546
DOI10.1016/0012-365X(84)90019-0zbMath0544.05028OpenAlexW2066125721MaRDI QIDQ796546
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
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)
Related Items
\(g\)-circulant solutions to the (0,1) matrix equation \(A^m=J_n\), On CIS circulants, Grinstead's conjecture is true for graphs with a small clique number, An approach to solving \(A^{k}=J-I\), Cayley partitionable graphs and near-factorizations of finite groups, On circulant thin Lehman matrices, Unnamed Item, On Moore bipartite digraphs, Thin Lehman matrices arising from finite groups, The strong perfect graph conjecture: 40 years of attempts, and its resolution
Cites Work