Index Terms
- Gauss codes, planar Hamiltonian graphs, and stack-sortable permutations
Recommendations
4-connected projective-planar graphs are Hamiltonian-connected
We generalize the following two seminal results.(1)Thomassen's result 15] in 1983, which says that every 4-connected planar graph is Hamiltonian-connected (which generalizes the old result of Tutte 16] in 1956, which says that every 4-connected planar ...
4-connected projective-planar graphs are hamiltonian-connected
SODA '13: Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete algorithmsWe generalize the following two seminal results.
1. Thomassen's result [19] in 1983, which says that every 4-connected planar graph is hamiltonian-connected (which generalizes the old result of Tutte [20] in 1956, which says that every 4-connected ...
Collapsible graphs and Hamiltonian connectedness of line graphs
Thomassen conjectured that every 4-connected line graph is Hamiltonian. Chen and Lai [Z.-H. Chen, H.-J. Lai, Reduction techniques for super-Eulerian graphs and related topics-an update, in: Ku Tung-Hsin (Ed.), Combinatorics and Graph Theory, vol. 95, ...
Comments