Cited in
(9)- The maximum clique problem
- Lower bounds on the independence number in terms of the degrees
- A Five-Color Theorem for Graphs on Surfaces
- Edge Partition of Toroidal Graphs into Forests in Linear Time
- The Independence Ratio and Genus of a Graph
- Transversals and colorings of simplicial spheres
- Visibility representations of toroidal and Klein-bottle graphs
- Induced forests in cubic graphs
- Random graphs on surfaces
This page was built for publication: On the independence ratio of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4159412)