scientific article; zbMATH DE number 3414331
From MaRDI portal
zbMath0263.05101MaRDI QIDQ5678882
Publication date: 1973
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Graph theory (05Cxx)
Related Items
An extension of Whitney's theorem to infinite strong triangulations, One-way infinite Hamiltonian paths in infinite maximal planar graphs, 2-connected 7-coverings of 3-connected graphs on surfaces, 5-Connected Toroidal Graphs are Hamiltonian-Connected, Chords of longest circuits in locally planar graphs, The circumference of a graph with no \(K_{3,t}\)-minor, Every 4-Connected Graph with Crossing Number 2 is Hamiltonian, 2-connected spanning subgraphs with low maximum degree in locally planar graphs, Hamiltonian Cycles in 4-Connected Planar and Projective Planar Triangulations with Few 4-Separators, On the circumference of 3-connected cubic triangle-free plane graphs, On 2-connected spanning subgraphs with low maximum degree, \([a,b\)-factors of graphs on surfaces], Hamiltonicity of 5‐Connected Toroidal Triangulations, Hamiltonicity of graphs on surfaces in terms of toughness and scattering number -- a survey, On hamiltonian circuits in Cayley diagrams, Subgraphs of graphs on surfaces with high representativity, Recent advances on the Hamiltonian problem: survey III, The matching extendability of surfaces, Structural properties for certain classes of infinite planar graphs, Unnamed Item, Hamilton paths in toroidal graphs, Unnamed Item, What is on his mind?, Hamiltonian properties of polyhedra with few 3-cuts. A survey, 2-edge-Hamiltonian-connectedness of 4-connected plane graphs, Cycles in 5-connected triangulations, A continuous analogue of Erdős' \(k\)-Sperner theorem, Criticality of counterexamples to toroidal edge-Hamiltonicity, Hamilton circles in infinite planar graphs, Infinite Hamilton cycles in squares of locally finite graphs, Regular \(n\)-valent \(n\)-connected non-Hamiltonian non \(n\)-edge-colourable graphs, Hamiltonian cycles in bipartite quadrangulations on the torus, 4-connected projective-planar graphs are Hamiltonian-connected
