Lower bounds for constant degree independent sets

DOI10.1016/0012-365X(92)00463-2zbMath0799.05031MaRDI QIDQ1322210

Debra L. Boutin, Michael O. Albertson

Publication date: 8 November 1994

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

treeboundsdegreeindependent setplanar graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (4)

Equating \(\kappa\) maximum degrees in graphs without short cycles ⋮ Irregular independence and irregular domination ⋮ Equating two maximum degrees ⋮ Regular independent sets

Cites Work

• Every planar map is four colorable. I: Discharging
• Every planar map is four colorable. II: Reducibility
• Lower bounds on the independence number in terms of the degrees
• People Who Know People
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Lower bounds for constant degree independent sets