Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey

DOI10.1016/J.DISC.2012.11.025zbMATH Open1277.05100OpenAlexW2094970300MaRDI QIDQ383779FDOQ383779

Authors: Hao Li 

Publication date: 6 December 2013

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2012.11.025

Recommendations

• On one extension of Dirac's theorem on Hamiltonicity
• scientific article; zbMATH DE number 4087693
• scientific article; zbMATH DE number 6438400
• Updating the hamiltonian problem—A survey
• scientific article; zbMATH DE number 1187334

zbMATH Keywords

circumferencedegreeimplicit degreepancyclicHamiltonian graphcyclable

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38)

Cites Work

• The binding number of a graph and its Anderson number
• Title not available (Why is that?)
• Long cycles in graphs with large degree sums
• Pancyclism in hamiltonian graphs
• Factorizations of regular graphs
• The \(k\)-dominating cycles in graphs
• Hamiltonicity of 4-connected graphs
• On degree sum conditions for long cycles and cycles through specified vertices
• On Hamilton's ideals
• Claw-free graphs---a survey
• Pancyclic graphs. I
• Graph theory with applications
• Note on Hamilton Circuits
• Some Theorems on Abstract Graphs
• A sufficient condition for all short cycles
• A note on Hamiltonian circuits
• 2‐neighborhoods and hamiltonian conditions
• Weakly pancyclic graphs
• Cycles through specified vertices
• New sufficient conditions for cycles in graphs
• Cyclable sets of vertices in 3-connected graphs
• An implicit degree condition for relative length of long paths and cycles in graphs
• Relative length of long paths and cycles in graphs with large degree sums
• Title not available (Why is that?)
• Implicit-degrees and circumferences
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• An implicit degree condition for long cycles in 2-connected graphs
• Large cycles in graphs
• An implicit degree condition for cyclability in graphs
• Title not available (Why is that?)
• An implicit degree condition for Hamiltonian graphs
• An implicit degree condition for Hamiltonian cycles
• The Geng-Hua Fan conditions for pancyclic or Hamilton-connected graphs
• Longest cycles in regular graphs
• Dominating cycles in regular 3-connected graphs
• Hamilton cycles in regular 3-connected graphs
• A method in graph theory
• Hamilton cycles in regular 2-connected graphs
• Hamiltonian Cycles in Regular Graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On relative length of longest paths and cycles
• Title not available (Why is that?)
• A degree sum condition concerning the connectivity and the independence number of a graph
• A cycle structure theorem for Hamiltonian graphs
• Small cycles in Hamiltonian graphs
• Pancyclic graphs and a conjecture of Bondy and Chvatal
• Removable matchings and Hamiltonian cycles
• A degree sum condition with connectivity for relative length of longest paths and cycles
• On a conjecture of Bondy
• Longest cycles in 3-connected cubic graphs
• A generalization of a result of Häggkvist and Nicoghossian
• A remark on Hamiltonian cycles
• Hamiltonism, degree sum and neighborhood intersections
• Long path connectivity of regular graphs
• A lower bound for the circumference of a graph
• Über Hamiltonsche Kreise und unabhängige Ecken in Graphen
• An Ore-type condition for pancyclability
• Locally pancyclic graphs
• A generalization of Ore's Theorem involving neighborhood unions
• Hamilton cycles in 2-connected regular bipartite graphs
• Longest cycles in 3-connected graphs
• Cycles through subsets with large degree sums
• Advances on the Hamiltonian problem -- a survey
• Weakly pancyclic graphs
• On cycles in 3-connected graphs
• On a conjecture of Woodall
• Cycles through prescribed vertices with large degree sum
• A note on a generalisation of Ore's condition
• Pancyclism and small cycles in graphs
• On the existence of Hamiltonian cycles after removing edges
• Title not available (Why is that?)
• Two sufficient conditions for dominating cycles
• Title not available (Why is that?)
• A degree sum condition for longest cycles in 3-connected graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Conditions for the Existence of Hamiltonian Circuits in Graphs Based on Vertex Degrees
• Title not available (Why is that?)
• A new sufficient condition for hamiltonian graphs
• Title not available (Why is that?)
• Edge disjoint cycles in graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Updating the hamiltonian problem—A survey
• Neighborhood unions and hamilton cycles
• Title not available (Why is that?)
• Hamiltonian graphs involving distances
• Title not available (Why is that?)
• Title not available (Why is that?)
• Edge-Disjoint Hamilton Cycles in Regular Graphs of Large Degree
• On Maximal Circuits in Finite Graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Hamiltonian graphs with neighborhood intersections
• Cyclability of 3-connected graphs
• Edge disjoint Hamilton cycles in graphs
• A σ_3 type condition for heavy cycles in weighted graphs
• An implicit weighted degree condition for heavy cycles
• Title not available (Why is that?)
• Title not available (Why is that?)
• Sequences, claws and cyclability of graphs
• Title not available (Why is that?)

Cited In (37)

• A note on degree sum conditions for 2-factors with a prescribed number of cycles in bipartite graphs
• Empirical Study of Phase Transition of Hamiltonian Cycle Problem in Random Graphs with Degrees Greater Than One
• The robust component structure of dense regular graphs and applications
• Cycle partitions of regular graphs
• On a Goodman-Hedetniemi sufficient condition for graph Hamiltonicity
• Title not available (Why is that?)
• Spanning trees with a bounded number of leaves
• Title not available (Why is that?)
• A degree sum condition on the order, the connectivity and the independence number for Hamiltonicity
• On Hamiltonicity of regular graphs with bounded second neighborhoods
• Hamilton-connected, vertex-pancyclic and bipartite holes
• Hamilton cycles in implicit claw-heavy graphs
• A degree condition for cycles passing through specified vertices and edges
• Locating any two vertices on Hamiltonian cycles in large graphs
• A Chvátal-Erdős condition for the existence of a cycle intersecting specified connected subgraphs
• Sufficient Conditions for a Connected Graph to Have a Hamiltonian Path
• Cyclability, connectivity and circumference
• Ore-type degree conditions for disjoint path covers in simple graphs
• A strengthening of Erdős-Gallai theorem and proof of Woodall's conjecture
• Hamiltonian paths, unit-interval complexes, and determinantal facet ideals
• Spectral conditions for graphs to be \(k\)-Hamiltonian or \(k\)-path-coverable
• Distributing pairs of vertices on Hamiltonian cycles
• Updating the hamiltonian problem—A survey
• 2-factors with \(k\) cycles in Hamiltonian graphs
• A sharp Ore-type condition for a connected graph with no induced star to have a Hamiltonian path
• Some Hamiltonian properties of one-conflict graphs
• Partitioning the vertices of a digraph into directed cycles and degenerated directed cycles
• Comparison of sufficient degree based conditions for Hamiltonian graph
• Circumference, minimum degree and clique number
• Long paths in bipartite graphs and path-bistar bipartite Ramsey numbers
• Connected graph \(G\) with \(\sigma_2(G) \geq \frac{2}{3} n\) and \(K_{1, 4}\)-free contains a Hamiltonian path
• On directed 2-factors in digraphs and 2-factors containing perfect matchings in bipartite graphs
• Robust Hamiltonicity of Dirac graphs
• Dirac type condition and Hamiltonian-connected graphs
• The Hamilton-connectivity with the degree sum of non-adjacent subgraphs of claw-free graphs
• The cycle spectrum of claw-free Hamiltonian graphs
• On the difference between Hamilton cycles and 2-factors with a prescribed number of cycles

This page was built for publication: Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q383779)