On minimal forbidden subgraph characterizations of balanced graphs
From MaRDI portal
Publication:5891090
Recommendations
Cites work
- scientific article; zbMATH DE number 1375569 (Why is no real title available?)
- scientific article; zbMATH DE number 3557519 (Why is no real title available?)
- scientific article; zbMATH DE number 553916 (Why is no real title available?)
- A polynomial recognition algorithm for balanced matrices
- Balanced matrices
- Line perfect graphs
- Maximum \(h\)-colourable subgraph problem in balanced graphs
- Motivations and history of some of my conjectures
- Normal hypergraphs and the perfect graph conjecture
- On balanced graphs
- On certain polytopes associated with graphs
- Recognizing Berge graphs
- The strong perfect graph theorem
Cited in
(6)- scientific article; zbMATH DE number 7397959 (Why is no real title available?)
- On minimal forbidden subgraph characterizations of balanced graphs
- Balancedness of subclasses of circular-arc graphs
- Balancedness of some subclasses of circular-arc graphs
- Clique-perfectness and balancedness of some graph classes
- On balanced graphs
This page was built for publication: On minimal forbidden subgraph characterizations of balanced graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5891090)