Quasi-star-cutsets and some consequences

DOI10.1016/S0377-2217(01)00213-2zbMath1007.90054OpenAlexW2048235268MaRDI QIDQ1600840

A. Zemirline

Publication date: 16 June 2002

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(01)00213-2

zbMATH Keywords

perfect graphseven pairminimal imperfect graphstar-cutsetodd pairgeneralized amalgamperfection-preserving compositionsquasi-star-cutset

Mathematics Subject Classification ID

Applications of graph theory (05C90) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The validity of the strong perfect-graph conjecture for \((K_4-e)\)-free graphs
• Topics on perfect graphs
• Weakly triangulated graphs
• Coloring perfect \((K_ 4\)-e)-free graphs
• A new conjecture about minimal imperfect graphs
• A new property of critical imperfect graphs and some consequences
• Two classes of perfect graphs
• Star-cutsets and perfect graphs
• Some properties of minimal imperfect graphs
• Coloring graphs with stable cutsets
• Critical perfect graphs and perfect 3-chromatic graphs
• Optimizing weakly triangulated graphs
• Compositions for perfect graphs
• Normal hypergraphs and the perfect graph conjecture
• A Combinatorial Decomposition Theory
• The connectivity of minimal imperfect graphs

This page was built for publication: Quasi-star-cutsets and some consequences