scientific article; zbMATH DE number 3353327
From MaRDI portal
Publication:5628163
zbMath0223.05123MaRDI QIDQ5628163
Publication date: 1971
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (68)
Proof of the 1-factorization and Hamilton Decomposition Conjectures ⋮ Two edge-disjoint Hamiltonian cycles in graphs ⋮ An implicit degree condition for relative length of long paths and cycles in graphs ⋮ Locating pairs of vertices on a Hamiltonian cycle in bigraphs ⋮ Longest paths joining given vertices in a graph ⋮ Multiply balanced edge colorings of multigraphs ⋮ On one extension of Dirac's theorem on Hamiltonicity ⋮ Hamiltonicity and cycle extensions in 0-block-intersection graphs of balanced incomplete block designs ⋮ A generalization of a result of Häggkvist and Nicoghossian ⋮ Long cycles in graphs with prescribed toughness and minimum degree ⋮ Lower bounds for the algebraic connectivity of graphs with specified subgraphs ⋮ Connectivity, traceability and Hamiltonicity ⋮ Minimum degree, independence number and regular factors ⋮ \(D_ \lambda\)-cycles in 3-cyclable graphs ⋮ Counting and packing Hamilton cycles in dense graphs and oriented graphs ⋮ Hamiltonicity, minimum degree and leaf number ⋮ Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey ⋮ Precise location of vertices on Hamiltonian cycles ⋮ Improved degree conditions for 2-factors with \(k\) cycles in Hamiltonian graphs ⋮ Dominating circuits in regular matroids ⋮ Two sufficient conditions for Hamilton and dominating cycles ⋮ Hamiltonian cycles with all small even chords ⋮ A spanning tree with at most \(k\) leaves in a \(K_{1,p}\)-free graph ⋮ On nonzero component graph of vector spaces over finite fields ⋮ Edge-diameter of a graph and its longest cycles ⋮ Edge degrees and dominating cycles ⋮ Non-Hamiltonian graphs with large minimum degree ⋮ Graph and hypergraph packing ⋮ An Extension of the Hajnal–Szemerédi Theorem to Directed Graphs ⋮ A remark on Hamiltonian cycles ⋮ On prisms, Möbius ladders and the cycle space of dense graphs ⋮ Circumference of a graph and its distance dominating longest cycles ⋮ Existence of dominating cycles and paths ⋮ Spanning paths in graphs ⋮ On a generalization of a theorem of Nash-Williams ⋮ Edge-dominating cycles in graphs ⋮ Spanning paths and cycles in triangle-free graphs ⋮ On Hamiltonian cycles in balanced \(k\)-partite graphs ⋮ Cycles containing many vertices of large degree ⋮ A note on a cycle partition problem ⋮ The \(k\)-dominating cycles in graphs ⋮ Graph invariants and large cycles: a survey ⋮ Pairs of Hamiltonian circuits in 5-connected planar graphs ⋮ Toughness in graphs -- a survey ⋮ A sufficient condition for Hamiltonian circuits ⋮ Edge-disjoint Hamilton cycles in graphs ⋮ Hamiltonian cycles in Dirac graphs ⋮ Chvátal-Erdős conditions for paths and cycles in graphs and digraphs. A survey ⋮ Searching symmetric networks with Utilitarian-Postman paths ⋮ A note on 1-factors in certain regular multigraphs ⋮ Hamilton cycles in regular 2-connected graphs ⋮ Automorphism group and other properties of zero component graph over a vector space ⋮ Note on locating pairs of vertices on Hamiltonian cycles ⋮ Removable matchings and Hamiltonian cycles ⋮ Bridges of longest cycles ⋮ Long cycles in graphs with large degree sums ⋮ Long cycles and the codiameter of a graph. I ⋮ Hamilton cycles in regular graphs ⋮ A note on Hamiltonian circuits ⋮ Dirac's Condition for Spanning Halin Subgraphs ⋮ An approximate version of Jackson’s conjecture ⋮ Coprime ordering of cyclic planar difference sets ⋮ Partitioning a graph into a cycle and a sparse graph ⋮ Existence of Dlambda-cycles and Dlambda-paths ⋮ Long cycles, degree sums and neighborhood unions ⋮ On the length of longest dominating cycles in graphs ⋮ Decomposing hypergraphs into cycle factors ⋮ Minimum degree of a graph and the existence of k-factors
This page was built for publication:
