Planar Graph Problems
- 1 January 1990
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 45 references indexed in Scilit:
- The hamiltonian cycle problem is linear-time solvable for 4-connected planar graphsJournal of Algorithms, 1989
- A theorem on paths in planar graphsJournal of Graph Theory, 1986
- Drawing plane graphs nicelyActa Informatica, 1985
- A linear algorithm for embedding planar graphs using PQ-treesJournal of Computer and System Sciences, 1985
- Approximation algorithms for NP-complete problems on planar graphsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1983
- An algorithm for finding a large independent set in planar graphsNetworks, 1983
- A linear 5-coloring algorithm of planar graphsJournal of Algorithms, 1981
- An upper bound on the length of a Hamiltonian walk of a maximal planar graphJournal of Graph Theory, 1980
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithmsJournal of Computer and System Sciences, 1976
- Finding an independent set in a planar graphPublished by Springer Nature ,1974