A theorem on paths in planar graphs
From MaRDI portal
Publication:5902601
DOI10.1002/jgt.3190070205zbMath0515.05040MaRDI QIDQ5902601
Publication date: 1983
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190070205
05C38: Paths and cycles
05C10: Planar graphs; geometric and topological aspects of graph theory
05C45: Eulerian and Hamiltonian graphs
Related Items
2- and 3-factors of graphs on surfaces, The 2-extendability of graphs on the projective plane, the torus and the Klein bottle, Extending matchings in planar graphs. IV, What is on his mind?, A note on traversing specified vertices in graphs embedded with large representativity, Hamiltonian cycles in cubic 3-connected bipartite planar graphs, The circumference of a graph with no \(K_{3,t}\)-minor, Hamiltonicity and colorings of arrangement graphs, 2-connected spanning subgraphs with low maximum degree in locally planar graphs, The matching extendability of surfaces, Hamiltonian cycles through prescribed edges of 4-connected maximal planar graphs, Long cycles in 4-connected planar graphs, Maximum bipartite subgraphs of cubic triangle-free planar graphs, A generalization of Tutte's theorem on Hamiltonian cycles in planar graphs, Decomposition theorems for the torus, projective plane and Klein bottle, Extending matchings in graphs: A survey, Spanning Eulerian subgraphs of bounded degree in triangulations, Graph-theoretical conditions for inscribability and Delaunay realizability, The complexity of recognizing tough cubic graphs, Tutte cycles in circuit graphs, Minimal arc-presentations of some nonalternating knots, On Hamiltonian cycles in 4- and 5-connected plane triangulations, Long cycles in graphs on a fixed surface, Cycles in 4-connected planar graphs, A theorem on paths in locally planar triangulations, Extending matchings in planar graphs. V, Finding Hamiltonian cycles in Delaunay triangulations is NP-complete, Hamilton paths in toroidal graphs, Hamilton circles in infinite planar graphs, Disjoint paths, planarizing cycles, and spanning walks
Cites Work
