\(P_4\)-domination in minimal imperfect graphs
From MaRDI portal
Publication:1293209
DOI10.1016/S0166-218X(99)00029-3zbMath0933.05115MaRDI QIDQ1293209
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
05C15: Coloring of graphs and hypergraphs
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
05C17: Perfect graphs
05C60: Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)
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