\(P_4\)-domination in minimal imperfect graphs

DOI10.1016/S0166-218X(99)00029-3zbMath0933.05115OpenAlexW1988669855MaRDI QIDQ1293209

Irena Rusu

Publication date: 4 April 2000

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

Full work available at URL: https://doi.org/10.1016/s0166-218x(99)00029-3

zbMATH Keywords

chromatic numberclique numberminimal imperfect graphsodd pair conjecture

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Perfect graphs (05C17) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Unnamed Item
• On rigid circuit graphs
• Coloring perfect \((K_ 4\)-e)-free graphs
• A new conjecture about minimal imperfect graphs
• A semi-strong perfect graph theorem
• A new property of critical imperfect graphs and some consequences
• No antitwins in minimal imperfect graphs
• Star-cutsets and perfect graphs
• Some properties of minimal imperfect graphs
• On critical edges in minimal imperfect graphs
• A characterization of perfect graphs
• On brittle graphs
• Perfect zero–one matrices