On essential components and critical sets of a graph

DOI10.1016/S0012-365X(97)81823-7zbMath0892.05035OpenAlexW2026535928MaRDI QIDQ1377850

S. Markossian, I. Karapetian, A. Markosian, G. S. Gasparian

Publication date: 27 July 1998

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(97)81823-7

zbMATH Keywords

stabilitystrong perfect graph conjectureminimal imperfect graphessential componentcritical componentBerge graph

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On conjecture of Berge
• Slim graphs
• Graphical properties related to minimal imperfection
• Three short proofs in graph theory
• On the perfect graph conjecture
• Combinatorial designs related to the strong perfect graph conjecture
• On the critical lines of a graph
• A characterization of perfect graphs
• Normal hypergraphs and the perfect graph conjecture
• Perfect zero–one matrices
• On the strong perfect graph conjecture

This page was built for publication: On essential components and critical sets of a graph