A semi-strong perfect graph theorem

DOI10.1016/0095-8956(87)90022-0MaRDI QIDQ1104341zbMATH OpenOpenAlexFDO

Authors Bruce Reed

Publication date 1987

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0095-8956(87)90022-0

zbMATH Keywords

perfect graph[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Chv%EF%BF%BD%EF%BF%BDtal%27s+conjecture&go=Go Chv��tal's conjecture]

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graph theory (05C99)

Recommendations

• scientific article; zbMATH DE number 3887731
• A semi-strong perfect digraph theorem
• A note on the semi-strong perfect graph conjecture
• The strong perfect graph theorem
• The strong perfect graph theorem
• A note on strong perfectness of graphs
• A class of strongly perfect graphs
• scientific article; zbMATH DE number 1789914
• scientific article; zbMATH DE number 3885936
• On the strong perfect graph conjecture

Cites work

• scientific article; zbMATH DE number 3887731 (Why is no real title available?)
• scientific article; zbMATH DE number 3141308 (Why is no real title available?)
• scientific article; zbMATH DE number 3152801 (Why is no real title available?)
• Graph reconstruction—a survey
• Normal hypergraphs and the perfect graph conjecture
• Star-cutsets and perfect graphs

Cited in

(29)

• On graphs with limited number of \(P_{4}\)-partners
• A Berge-keeping operation for graphs
• The strong perfect graph conjecture: 40 years of attempts, and its resolution
• On the strong perfect graph conjecture
• A new characterization of \(P_4\)-connected graphs
• An efficient algorithm for solving the homogeneous set sandwich problem
• Building counterexamples
• Graphs defined on groups
• Quasi-parity and perfect graphs
• Bipartite-perfect graphs
• A weak box-perfect graph theorem
• Recognizing the \(P_ 4\)-structures of a tree
• The use of a pruned modular decomposition for \textsc{maximum matching} algorithms on some graph classes
• A Theorem on Reconstruction of Random Graphs
• Perfect graphs with unique \(P_ 4\)-structure
• Counterexamples to three conjectures concerning perfect graphs
• Recognizing the \(P_4\)-structure of bipartite graphs
• The graph sandwich problem for 1-join composition is NP-complete
• On the sibling-structure of perfect graphs
• Antitwins in partitionable graphs
• \(P_4\)-domination in minimal imperfect graphs
• On the disc-structure of perfect graphs. I: The co-paw-structure
• Note on the homogeneous set sandwich problem
• Strong and semi strong outer mod sum graphs
• The homogeneous set sandwich problem
• scientific article; zbMATH DE number 3887731 (Why is no real title available?)
• Recognizing the \(P_4\)-structure of block graphs
• A semi-strong perfect digraph theorem
• Properties of large 2-crossing-critical graphs

This page was built for publication: A semi-strong perfect graph theorem

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