Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey
From MaRDI portal
Publication:383779
DOI10.1016/j.disc.2012.11.025zbMath1277.05100OpenAlexW2094970300MaRDI QIDQ383779
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
Related Items
A degree sum condition on the order, the connectivity and the independence number for Hamiltonicity, A Chvátal-Erdős condition for the existence of a cycle intersecting specified connected subgraphs, Cycle partitions of regular graphs, On Hamiltonicity of regular graphs with bounded second neighborhoods, Distributing pairs of vertices on Hamiltonian cycles, Hamiltonian paths, unit-interval complexes, and determinantal facet ideals, A note on degree sum conditions for 2-factors with a prescribed number of cycles in bipartite graphs, Connected graph \(G\) with \(\sigma_2(G) \geq \frac{2}{3} n\) and \(K_{1, 4}\)-free contains a Hamiltonian path, The robust component structure of dense regular graphs and applications, 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, Hamilton-connected, vertex-pancyclic and bipartite holes, A degree condition for cycles passing through specified vertices and edges, Hamilton cycles in implicit claw-heavy graphs, On the difference between Hamilton cycles and 2-factors with a prescribed number of cycles, Ore-type degree conditions for disjoint path covers in simple graphs, Cyclability, connectivity and circumference, Partitioning the vertices of a digraph into directed cycles and degenerated directed cycles, On Directed 2-factors in Digraphs and 2-factors Containing Perfect Matchings in Bipartite Graphs, Sufficient Conditions for a Connected Graph to Have a Hamiltonian Path, A strengthening of Erdős-Gallai theorem and proof of Woodall's conjecture, Empirical Study of Phase Transition of Hamiltonian Cycle Problem in Random Graphs with Degrees Greater Than One, COMPARISON OF SUFFICIENT DEGREE BASED CONDITIONS FOR HAMILTONIAN GRAPH, The Hamilton-connectivity with the degree sum of non-adjacent subgraphs of claw-free graphs, Spectral conditions for graphs to be \(k\)-Hamiltonian or \(k\)-path-coverable, Spanning trees with a bounded number of leaves, The cycle spectrum of claw-free Hamiltonian graphs, Long paths in bipartite graphs and path-bistar bipartite Ramsey numbers, Locating any two vertices on Hamiltonian cycles in large graphs, 2-factors with \(k\) cycles in Hamiltonian graphs, On a Goodman – Hedetniemi Sufficient Condition for the Graph Hamiltonicity
Cites Work
- Cyclable sets of vertices in 3-connected graphs
- An implicit degree condition for relative length of long paths and cycles in graphs
- An implicit degree condition for Hamiltonian graphs
- An implicit weighted degree condition for heavy cycles
- Cycles through specified vertices
- Long cycles in graphs with large degree sums
- New sufficient conditions for cycles in graphs
- Pancyclism in hamiltonian graphs
- Implicit-degrees and circumferences
- 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
- Removable matchings and Hamiltonian cycles
- A degree sum condition concerning the connectivity and the independence number of a graph
- An implicit degree condition for long cycles in 2-connected graphs
- A degree sum condition with connectivity for relative length of longest paths and cycles
- On a conjecture of Bondy
- Longest cycles in regular graphs
- Longest cycles in 3-connected cubic graphs
- A cycle structure theorem for Hamiltonian graphs
- The Geng-Hua Fan conditions for pancyclic or Hamilton-connected 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
- Dominating cycles in regular 3-connected graphs
- Hamilton cycles in regular 3-connected graphs
- A method in graph theory
- A lower bound for the circumference of a graph
- Hamilton cycles in regular 2-connected graphs
- Ü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
- Claw-free graphs---a survey
- Longest cycles in 3-connected graphs
- Cycles through subsets with large degree sums
- A sufficient condition for all short cycles
- Small cycles in Hamiltonian graphs
- Pancyclic graphs and a conjecture of Bondy and Chvatal
- 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
- Pancyclic graphs. I
- On Hamilton's ideals
- Large cycles in graphs
- A note on Hamiltonian circuits
- Pancyclism and small cycles in graphs
- An Implicit Degree Condition for Cyclability in Graphs
- Two sufficient conditions for dominating cycles
- Note on Hamilton Circuits
- A degree sum condition for longest cycles in 3-connected graphs
- On relative length of longest paths and cycles
- Conditions for the Existence of Hamiltonian Circuits in Graphs Based on Vertex Degrees
- A new sufficient condition for hamiltonian graphs
- Edge disjoint cycles in graphs
- Updating the hamiltonian problem—A survey
- Neighborhood unions and hamilton cycles
- Hamiltonian graphs involving distances
- 2‐neighborhoods and hamiltonian conditions
- Hamiltonian Cycles in Regular Graphs
- Edge-Disjoint Hamilton Cycles in Regular Graphs of Large Degree
- On Maximal Circuits in Finite Graphs
- 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
- Relative length of long paths and cycles in graphs with large degree sums
- Sequences, claws and cyclability of graphs
- The binding number of a graph and its Anderson number
- Some Theorems on Abstract Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
