The Independence Ratio and Genus of a Graph
From MaRDI portal
Publication:4124854
DOI10.2307/1997946zbMath0354.05030OpenAlexW4256091491MaRDI QIDQ4124854
Joan P. Hutchinson, Michael O. Albertson
Publication date: 1977
Full work available at URL: https://doi.org/10.2307/1997946
Planar graphs; geometric and topological aspects of graph theory (05C10) Relations of low-dimensional topology with graph theory (57M15) Coloring of graphs and hypergraphs (05C15)
Related Items
Extending precolorings of subgraphs of locally planar graphs ⋮ Coloring vertices and faces of locally planar graphs ⋮ Algorithms for the edge-width of an embedded graph ⋮ Grünbaum colorings of toroidal triangulations
Cites Work
- Unnamed Item
- Unnamed Item
- Inégalités nouvelles dans le problème des quatre couleurs
- A lower bound for the independence number of a planar graph
- Short Proof of a Map-Colour Theorem
- The maximum size of an independent set in a nonplanar graph
- On the independence ratio of a graph
- SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM
