Grinstead's conjecture is true for graphs with a small clique number

DOI10.1016/j.disc.2005.12.040zbMath1131.05073OpenAlexW2028281168WikidataQ122908143 ScholiaQ122908143MaRDI QIDQ2433715

Kenji Kashiwabara, Tadashi Sakuma

Publication date: 30 October 2006

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2005.12.040

zbMATH Keywords

CGPW-graphcircular partitionable graphGrinstead's conjecture

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (5)

On CIS circulants ⋮ Grinstead's conjecture is true for graphs with a small clique number ⋮ On circulant thin Lehman matrices ⋮ Unnamed Item ⋮ Thin Lehman matrices arising from finite groups

Cites Work

• On circular critical graphs
• Topics on perfect graphs
• The strong perfect graph theorem
• Graphical properties related to minimal imperfection
• Grinstead's conjecture is true for graphs with a small clique number
• Perfect zero–one matrices
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Grinstead's conjecture is true for graphs with a small clique number