The Independence Ratio and Genus of a Graph

DOI10.2307/1997946zbMATH Open0354.05030OpenAlexW4256091491MaRDI QIDQ4124854FDOQ4124854

Authors: Michael O. Albertson, Joan P. Hutchinson 

Publication date: 1977

Full work available at URL: https://doi.org/10.2307/1997946

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Relations of low-dimensional topology with graph theory (57M15)

Cites Work

• SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM
• A lower bound for the independence number of a planar graph
• Title not available (Why is that?)
• On the independence ratio of a graph
• Short Proof of a Map-Colour Theorem
• Inégalités nouvelles dans le problème des quatre couleurs
• The maximum size of an independent set in a nonplanar graph
• Title not available (Why is that?)

Cited In (4)

• Algorithms for the edge-width of an embedded graph
• Grünbaum colorings of toroidal triangulations
• Extending precolorings of subgraphs of locally planar graphs
• Coloring vertices and faces of locally planar graphs

This page was built for publication: The Independence Ratio and Genus of a Graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4124854)