Balancedness of some subclasses of circular-arc graphs
From MaRDI portal
Recommendations
Cites work
- Balanced matrices
- Characterizations of strongly chordal graphs
- Coloring a Family of Circular Arcs
- scientific article; zbMATH DE number 3557519 (Why is no real title available?)
- scientific article; zbMATH DE number 553916 (Why is no real title available?)
- Linear-time recognition of Helly circular-arc models and graphs
- Maximum \(h\)-colourable subgraph problem in balanced graphs
- Neighborhood perfect graphs
- On balanced graphs
- On certain polytopes associated with graphs
- On minimal forbidden subgraph characterizations of balanced graphs
- Partial characterizations of circular-arc graphs
- The strong perfect graph theorem
Cited in
(2)
This page was built for publication: Balancedness of some subclasses of circular-arc graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2861542)