scientific article; zbMATH DE number 4116566

MaRDI QIDQ4731202zbMATH OpenFDO

Authors Michele Conforti

Publication date 1989

zbMATH Keywords

linear hypergraphsStrong perfect graph conjecture

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65) Graph theory (05C99)

Recommendations

• Articulation sets in linear perfect matrices. I: Forbidden configurations and star cutsets
• The strong perfect graph theorem
• Coloring perfect \((K_ 4\)-e)-free graphs
• On the strong perfect graph conjecture
• On Tucker's proof of the strong perfect graph conjecture for \((K_4-e)\)-free graphs

Cited in

(7)

• Coloring perfect \((K_ 4\)-e)-free graphs
• Articulation sets in linear perfect matrices. I: Forbidden configurations and star cutsets
• Odd cycles and matrices with integrality properties
• Structural results on circular-arc graphs and circle graphs: a survey and the main open problems
• Partial characterizations of circular-arc graphs
• Arboricity, \(h\)-index, and dynamic algorithms
• Addendum to: M. Conforti and M. R. Rao, ``Articulation sets in linear perfect matrices. I: Forbidden configurations and star cutsets, Discrete Mathematics 104 (1992) 23--47

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 Q4731202)