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