A lower bound for the independence number of a planar graph
From MaRDI portal
Publication:1845888
DOI10.1016/0095-8956(76)90071-XzbMath0286.05105MaRDI QIDQ1845888
Publication date: 1976
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Relations of low-dimensional topology with graph theory (57M15)
Related Items (9)
Planar graphs have independence ratio at least 3/13 ⋮ 3‐Degenerate induced subgraph of a planar graph ⋮ The maximum size of an independent set in a nonplanar graph ⋮ An introduction to the discharging method via graph coloring ⋮ Induced 2-degenerate subgraphs of triangle-free planar graphs ⋮ Planar graphs are \(9/2\)-colorable ⋮ Subcubic triangle-free graphs have fractional chromatic number at most 14/5 ⋮ Planar graphs without cycles of length 4 or 5 are \((11 : 3)\)-colorable ⋮ The Independence Ratio and Genus of a Graph
Cites Work
This page was built for publication: A lower bound for the independence number of a planar graph
