scientific article; zbMATH DE number 3885919

MaRDI QIDQ3220596zbMATH OpenFDO

Authors

Publication date 1984

zbMATH Keywords

combinatorial designsstrong perfect graph conjecture

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Coloring of graphs and hypergraphs (05C15) Graph theory (05C99)

Cited in

(10)

• No antitwins in minimal imperfect graphs
• Cayley partitionable graphs and near-factorizations of finite groups
• More on discrete convexity
• Grinstead's conjecture is true for graphs with a small clique number
• On circulant thin Lehman matrices
• On a conjecture about uniquely colorable perfect graphs
• Slightly triangulated graphs are perfect
• scientific article; zbMATH DE number 3849246 (Why is no real title available?)
• Thin Lehman matrices arising from finite groups
• On the Laplacian spectrum of (\(\alpha,\omega\))-graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3220596)