The maximum size of an independent set in a nonplanar graph

DOI10.1090/S0002-9904-1975-13735-9zbMath0311.05107OpenAlexW2071704290MaRDI QIDQ4068742

Michael O. Albertson, Joan P. Hutchinson

Publication date: 1975

Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0002-9904-1975-13735-9

Mathematics Subject Classification ID

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 (2)

Grünbaum colorings of toroidal triangulations ⋮ The Independence Ratio and Genus of a Graph

Cites Work

• Unnamed Item
• A lower bound for the independence number of a planar graph
• SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM

This page was built for publication: The maximum size of an independent set in a nonplanar graph