A semi-strong perfect graph theorem
From MaRDI portal
Publication:1104341
DOI10.1016/0095-8956(87)90022-0zbMath0647.05052OpenAlexW2031510973MaRDI QIDQ1104341
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
Graph theory (05C99) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (25)
The graph sandwich problem for 1-join composition is NP-complete ⋮ The homogeneous set sandwich problem ⋮ Note on the homogeneous set sandwich problem ⋮ Recognizing the \(P_ 4\)-structures of a tree ⋮ Quasi-parity and perfect graphs ⋮ Perfect graphs with unique \(P_ 4\)-structure ⋮ Building counterexamples ⋮ A Theorem on Reconstruction of Random Graphs ⋮ The use of a pruned modular decomposition for \textsc{maximum matching} algorithms on some graph classes ⋮ Properties of Large 2-Crossing-Critical Graphs ⋮ A Berge-keeping operation for graphs ⋮ Recognizing the \(P_4\)-structure of block graphs ⋮ Counterexamples to three conjectures concerning perfect graphs ⋮ Graphs defined on groups ⋮ On the strong perfect graph conjecture ⋮ Antitwins in partitionable graphs ⋮ On the sibling-structure of perfect graphs ⋮ A semi-strong perfect digraph theorem ⋮ Bipartite-perfect graphs ⋮ On the disc-structure of perfect graphs. I: The co-paw-structure ⋮ \(P_4\)-domination in minimal imperfect graphs ⋮ The strong perfect graph conjecture: 40 years of attempts, and its resolution ⋮ Recognizing the \(P_4\)-structure of bipartite graphs ⋮ ON GRAPHS WITH LIMITED NUMBER OF P4-PARTNERS ⋮ An efficient algorithm for solving the homogeneous set sandwich problem
Cites Work
This page was built for publication: A semi-strong perfect graph theorem
