A theorem on paths in planar graphs
From MaRDI portal
Publication:5902601
DOI10.1002/jgt.3190070205zbMath0515.05040OpenAlexW2078415120MaRDI 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
Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Eulerian and Hamiltonian graphs (05C45)
Related Items (71)
Spanning Eulerian subgraphs of bounded degree in triangulations ⋮ Cycles in 4-connected planar graphs ⋮ A theorem on paths in locally planar triangulations ⋮ Counting Hamiltonian cycles in planar triangulations ⋮ Every 5-connected planar triangulation is 4-ordered Hamiltonian ⋮ Graph-theoretical conditions for inscribability and Delaunay realizability ⋮ 5-Connected Toroidal Graphs are Hamiltonian-Connected ⋮ Decomposition theorems for the torus, projective plane and Klein bottle ⋮ The circumference of a graph with no \(K_{3,t}\)-minor ⋮ Hamiltonicity and colorings of arrangement graphs ⋮ Every 4-Connected Graph with Crossing Number 2 is Hamiltonian ⋮ The complexity of recognizing tough cubic graphs ⋮ Extending matchings in planar graphs. V ⋮ Finding Hamiltonian cycles in Delaunay triangulations is NP-complete ⋮ 2-connected spanning subgraphs with low maximum degree in locally planar graphs ⋮ Computing Tutte Paths ⋮ Tutte cycles in circuit graphs ⋮ The 2-extendability of graphs on the projective plane, the torus and the Klein bottle ⋮ Construction of Barnette graphs whose large subgraphs are non-Hamiltonian ⋮ Minimal arc-presentations of some nonalternating knots ⋮ Find subtrees of specified weight and cycles of specified length in linear time ⋮ On the hamiltonicity of a planar graph and its vertex‐deleted subgraphs ⋮ Rooted minors and locally spanning subgraphs ⋮ An existence criterion for a cycle such that the vertices not included in it are independent ⋮ Planar Digraphs of Digirth Four are 2-Colorable ⋮ Extremal \(K_4\)-minor-free graphs without short cycles ⋮ Hamiltonicity of graphs on surfaces in terms of toughness and scattering number -- a survey ⋮ Recent advances on the Hamiltonian problem: survey III ⋮ The matching extendability of surfaces ⋮ Unnamed Item ⋮ Spanning closed walks and TSP in 3-connected planar graphs ⋮ On longest cycles in essentially 4-connected planar graphs ⋮ On longest cycles in essentially 4-connected planar graphs ⋮ Extending matchings in planar graphs. IV ⋮ Hamiltonian cycles through prescribed edges of 4-connected maximal planar graphs ⋮ Hamilton paths in toroidal graphs ⋮ Unnamed Item ⋮ What is on his mind? ⋮ A note on traversing specified vertices in graphs embedded with large representativity ⋮ Spanning trees in 3-connected \(K_{3,t}\)-minor-free graphs ⋮ Unnamed Item ⋮ Hamiltonian properties of polyhedra with few 3-cuts. A survey ⋮ 2- and 3-factors of graphs on surfaces ⋮ A new proof that 4-connected planar graphs are Hamiltonian-connected ⋮ 2-edge-Hamiltonian-connectedness of 4-connected plane graphs ⋮ Cycles in 5-connected triangulations ⋮ Criticality of counterexamples to toroidal edge-Hamiltonicity ⋮ Hamilton circles in infinite planar graphs ⋮ Shortness coefficient of cyclically 4-edge-connected cubic graphs ⋮ Long cycles in 4-connected planar graphs ⋮ Maximum bipartite subgraphs of cubic triangle-free planar graphs ⋮ 4-connected polyhedra have at least a linear number of Hamiltonian cycles ⋮ Cycle spectra of contraction-critically 4-connected planar graphs ⋮ Counting Hamiltonian cycles on quartic 4-vertex-connected planar graphs ⋮ Number of Hamiltonian Cycles in Planar Triangulations ⋮ Book Embedding of Graphs on the Projective Plane ⋮ Hamiltonian cycles in bipartite quadrangulations on the torus ⋮ A generalization of Tutte's theorem on Hamiltonian cycles in planar graphs ⋮ On Hamiltonian cycles in 4- and 5-connected plane triangulations ⋮ Spanning trees in 3-connected K3,t-minor-free graphs ⋮ Disjoint paths, planarizing cycles, and spanning walks ⋮ On the Hamiltonian property hierarchy of 3-connected planar graphs ⋮ Long cycles in graphs on a fixed surface ⋮ Tutte paths and long cycles in circuit graphs ⋮ Unnamed Item ⋮ 4-connected projective-planar graphs are Hamiltonian-connected ⋮ Hamiltonian cycles in cubic 3-connected bipartite planar graphs ⋮ Hamiltonian-connectedness of triangulations with few separating triangles ⋮ Distribution of subtree sums ⋮ Equivalence of Jackson's and Thomassen's conjectures ⋮ Extending matchings in graphs: A survey
Cites Work
This page was built for publication: A theorem on paths in planar graphs
