scientific article; zbMATH DE number 3414331

From MaRDI portal
Revision as of 04:28, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5678882

zbMath0263.05101MaRDI QIDQ5678882

C. St. J. A. Nash-Williams

Publication date: 1973


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



Related Items (33)

An extension of Whitney's theorem to infinite strong triangulationsOne-way infinite Hamiltonian paths in infinite maximal planar graphs2-connected 7-coverings of 3-connected graphs on surfaces5-Connected Toroidal Graphs are Hamiltonian-ConnectedChords of longest circuits in locally planar graphsThe circumference of a graph with no \(K_{3,t}\)-minorEvery 4-Connected Graph with Crossing Number 2 is Hamiltonian2-connected spanning subgraphs with low maximum degree in locally planar graphsHamiltonian Cycles in 4-Connected Planar and Projective Planar Triangulations with Few 4-SeparatorsOn the circumference of 3-connected cubic triangle-free plane graphsOn 2-connected spanning subgraphs with low maximum degree\([a,b\)-factors of graphs on surfaces] ⋮ Hamiltonicity of 5‐Connected Toroidal TriangulationsHamiltonicity of graphs on surfaces in terms of toughness and scattering number -- a surveyOn hamiltonian circuits in Cayley diagramsSubgraphs of graphs on surfaces with high representativityRecent advances on the Hamiltonian problem: survey IIIThe matching extendability of surfacesStructural properties for certain classes of infinite planar graphsUnnamed ItemHamilton paths in toroidal graphsUnnamed ItemWhat is on his mind?Hamiltonian properties of polyhedra with few 3-cuts. A survey2-edge-Hamiltonian-connectedness of 4-connected plane graphsCycles in 5-connected triangulationsA continuous analogue of Erdős' \(k\)-Sperner theoremCriticality of counterexamples to toroidal edge-HamiltonicityHamilton circles in infinite planar graphsInfinite Hamilton cycles in squares of locally finite graphsRegular \(n\)-valent \(n\)-connected non-Hamiltonian non \(n\)-edge-colourable graphsHamiltonian cycles in bipartite quadrangulations on the torus4-connected projective-planar graphs are Hamiltonian-connected







This page was built for publication: