scientific article; zbMATH DE number 3515497
From MaRDI portal
Publication:4094891
zbMath0329.05113MaRDI QIDQ4094891
Publication date: 1976
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Dense on-line arbitrarily partitionable graphs ⋮ The diameter of the cube-connected cycles ⋮ On the Hamiltonian number of a plane graph ⋮ The Hamiltonian Number of Cubic Graphs ⋮ Path partition number in tough graphs ⋮ Hamiltonicity of 2-connected claw-center independent graphs ⋮ Hamiltonian cycles in linear-convex supergrid graphs ⋮ The longest cycles in a graph G with minimum degree at least \(| G| /k\) ⋮ Long cycles through specified vertices ⋮ A note on dominating cycles in 2-connected graphs ⋮ Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey ⋮ Hamiltonian numbers in oriented graphs ⋮ Algorithms for long paths in graphs ⋮ Length of longest cycles in a graph whose relative length is at least two ⋮ Dense arbitrarily vertex decomposable graphs ⋮ Degree sum conditions for the circumference of 4-connected graphs ⋮ Minimum number of edges guaranteeing the existence of a \(K_{1, t}\)-factor in a graph ⋮ Long cycles in unbalanced bipartite graphs ⋮ Hamiltonian cycles in particular k-partite graphs ⋮ Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ The Hamiltonian numbers in digraphs ⋮ A strengthening of Erdős-Gallai theorem and proof of Woodall's conjecture ⋮ Spanning \(k\)-forests with large components in \(K_{1,k+1}\)-free graphs ⋮ Graphs generalizing closed curves with linear construction of the Hamiltonian cycle ⋮ The Hamiltonian connectivity of rectangular supergrid graphs ⋮ Hamiltonian spectra of graphs ⋮ A note on a cycle partition problem ⋮ Toughness in graphs -- a survey ⋮ Algorithm for two disjoint long paths in 2-connected graphs ⋮ An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs ⋮ On degree sum conditions for long cycles and cycles through specified vertices ⋮ An implicit degree condition for long cycles in 2-connected graphs ⋮ Finding long cycles in balanced tripartite graphs: a first step ⋮ Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs ⋮ Hamiltonian Extension ⋮ Existence of two disjoint long cycles in graphs ⋮ New sufficient conditions for cycles in graphs
This page was built for publication:
