Planar graphs, Hamilton cycles and extreme independence number

DOI10.1007/BF02085644zbMath0815.90133MaRDI QIDQ1339131

Samuel Jurkiewicz

Publication date: 1 December 1994

Published in: Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

planar graphsindependent setsHamilton cycles1-toughnessextreme independence number

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (1)

Unnamed Item

Cites Work

• A 1-tough nonhamiltonian maximal planar graph
• Planar graphs: Theory and algorithms
• Tough graphs and Hamiltonian circuits.
• Hamiltonian circuits on 3-polytopes

This page was built for publication: Planar graphs, Hamilton cycles and extreme independence number