Combinatorial designs related to the strong perfect graph conjecture

DOI10.1016/0012-365X(79)90114-6zbMath0403.05017WikidataQ123268227 ScholiaQ123268227MaRDI QIDQ1255951

K. Appert

Publication date: 1979

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

zbMATH Keywords

Strong Perfect Graph ConjectureCombinatorial Designs

Mathematics Subject Classification ID

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

Related Items

Near-perfect matrices, \(g\)-circulant solutions to the (0,1) matrix equation \(A^m=J_n\), On transversals in minimal imperfect graphs, Directed Moore hypergraphs, Star-cutsets and perfect graphs, On essential components and critical sets of a graph, Friendship two-graphs, Some properties of minimal imperfect graphs, Complementation in T-perfect graphs, On CIS circulants, A Sum of Squares Characterization of Perfect Graphs, Perfect graphs, kernels, and cores of cooperative games, An approach to solving \(A^{k}=J-I\), A classification of certain graphs with minimal imperfection properties, On the combinatorial problems which I would most like to see solved, A vertex critical graph without critical edges, Unnamed Item, Structure of cubic Lehman matrices, Partitionable graphs, circle graphs, and the Berge strong perfect graph conjecture, The strong perfect graph conjecture: 40 years of attempts, and its resolution, A Class of Perfect Graphs, On circular critical graphs, A family of perfect graphs associated with directed graphs, Non-regular square bipartite designs

Cites Work

• Unnamed Item
• Unnamed Item
• Resolvable balanced bipartite designs
• Critical perfect graphs and perfect 3-chromatic graphs
• On the existence of balanced bipartite designs. II
• Combinatorial designs and related systems
• A characterization of perfect graphs
• Normal hypergraphs and the perfect graph conjecture
• Perfect zero–one matrices
• On the strong perfect graph conjecture