scientific article; zbMATH DE number 3885919

zbMATH Open0556.05012MaRDI QIDQ3220596FDOQ3220596

Authors:

Publication date: 1984

Title of this publication is not available (Why is that?)

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 (9)

• No antitwins in minimal imperfect graphs
• Cayley partitionable graphs and near-factorizations of finite groups
• 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
• Title not available (Why is that?)
• Slightly triangulated graphs are perfect
• 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)