A semi-strong perfect graph theorem
DOI10.1016/0095-8956(87)90022-0zbMATH Open0647.05052OpenAlexW2031510973MaRDI QIDQ1104341FDOQ1104341
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
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
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]
Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graph theory (05C99)
Cites Work
Cited In (28)
- Counterexamples to three conjectures concerning perfect graphs
- On the strong perfect graph conjecture
- The use of a pruned modular decomposition for \textsc{maximum matching} algorithms on some graph classes
- Quasi-parity and perfect graphs
- The graph sandwich problem for 1-join composition is NP-complete
- The homogeneous set sandwich problem
- \(P_4\)-domination in minimal imperfect graphs
- On the disc-structure of perfect graphs. I: The co-paw-structure
- Recognizing the \(P_4\)-structure of bipartite graphs
- Note on the homogeneous set sandwich problem
- On the sibling-structure of perfect graphs
- Recognizing the \(P_4\)-structure of block graphs
- An efficient algorithm for solving the homogeneous set sandwich problem
- The strong perfect graph conjecture: 40 years of attempts, and its resolution
- Bipartite-perfect graphs
- Recognizing the \(P_ 4\)-structures of a tree
- A Berge-keeping operation for graphs
- Building counterexamples
- A Theorem on Reconstruction of Random Graphs
- Perfect graphs with unique \(P_ 4\)-structure
- Properties of Large 2-Crossing-Critical Graphs
- A semi-strong perfect digraph theorem
- On graphs with limited number of \(P_{4}\)-partners
- Graphs defined on groups
- Antitwins in partitionable graphs
- Title not available (Why is that?)
- A new characterization of \(P_4\)-connected graphs
- Strong and semi strong outer mod sum 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)
