The Independence Ratio and Genus of a Graph

DOI10.2307/1997946MaRDI QIDQ4124854zbMATH OpenOpenAlexFDO

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

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

Cited in

(5)

• Extending precolorings of subgraphs of locally planar graphs
• Algorithms for the edge-width of an embedded graph
• Grünbaum colorings of toroidal triangulations
• Computing shortest closed curves on non-orientable surfaces
• 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)