scientific article

zbMath0757.05074MaRDI QIDQ4014627

Bill Jackson, Nicholas C. Wormald

Publication date: 18 October 1992

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Hamiltonian graphsspanning closed walkresult of Oberly and Sumner

Mathematics Subject Classification ID

Trees (05C05) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items (42)

Spanning Eulerian subgraphs of bounded degree in triangulations ⋮ Spanning trees and spanning closed walks with small degrees ⋮ Hamilton cycles in line graphs of 3-hypergraphs ⋮ Claw-free graphs---a survey ⋮ 2-connected spanning subgraphs with low maximum degree in locally planar graphs ⋮ Thomassen's conjecture for line graphs of 3-hypergraphs ⋮ Computing Tutte Paths ⋮ Forbidden subgraphs and the existence of spanning \(k\)-trees ⋮ On 2-connected spanning subgraphs with low maximum degree ⋮ The Chvátal-Erdős condition for prism-Hamiltonicity ⋮ Spanning trails with maximum degree at most 4 in \(2K_2\)-free graphs ⋮ Forbidden subgraphs and the existence of a 2-walk ⋮ Toughness and spanning trees in K4‐minor‐free graphs ⋮ A forbidden pair for connected graphs to have spanning k‐trees ⋮ The parity Hamiltonian cycle problem ⋮ Walks in phylogenetic treespace ⋮ Hamiltonicity of graphs on surfaces in terms of toughness and scattering number -- a survey ⋮ Graph toughness from Laplacian eigenvalues ⋮ Subgraphs of graphs on surfaces with high representativity ⋮ Unnamed Item ⋮ Spanning closed walks and TSP in 3-connected planar graphs ⋮ Spanning trees: A survey ⋮ On 2-connected spanning subgraphs with bounded degree in \(K _{1,r }\)-free graphs ⋮ How many conjectures can you stand? A survey ⋮ Spanning \(k\)-forests with large components in \(K_{1,k+1}\)-free graphs ⋮ Toughness threshold for the existence of 2-walks in \(K_{4}\)-minor-free graphs ⋮ The computational complexity of the parallel knock-out problem ⋮ The prism over the middle-levels graph is Hamiltonian ⋮ On the pancyclicity of lexicographic products ⋮ A note on \(k\)-walks in bridgeless graphs ⋮ A note on interconnecting matchings in graphs ⋮ Types of triangle in Hamiltonian triangulations and an application to domination and k-walks ⋮ Degree sum condition for the existence of spanning \(k\)-trees in star-free graphs ⋮ On hamiltonian cycles in the prism over the odd graphs ⋮ Edge-dominating cycles, k-walks and Hamilton prisms in 2K2-free graphs ⋮ Toughness and prism-Hamiltonicity of \(P_4\)-free graphs ⋮ On 2-walks in chordal planar graphs ⋮ A degree sum condition for graphs to be prism Hamiltonian ⋮ \([2,3\)-factors in a 3-connected infinite planar graph.] ⋮ On the Hamiltonian property hierarchy of 3-connected planar graphs ⋮ Ore-type conditions for the existence of even \([2,b\)-factors in graphs] ⋮ Hamiltonicity and pancyclicity of generalized prisms

This page was built for publication: