A note on the semi-strong perfect graph conjecture

DOI10.1016/0012-365X(85)90068-8zbMATH Open0614.05030WikidataQ123149619 ScholiaQ123149619MaRDI QIDQ1820169FDOQ1820169

Authors: Bruce Reed 

Publication date: 1985

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

zbMATH Keywords

chromatic numberperfect graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)

Cites Work

• Normal hypergraphs and the perfect graph conjecture
• Title not available (Why is that?)

Cited In (6)

• A note on strong and co-strong perfectness of the X-join of graphs
• On Tucker's proof of the strong perfect graph conjecture for \((K_4-e)\)-free graphs
• Weakly triangulated graphs
• A semi-strong perfect graph theorem
• On the \(P_ 4\)-structure of perfect graphs. IV: Partner graphs
• Title not available (Why is that?)

This page was built for publication: A note on the semi-strong perfect graph conjecture

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