Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey
From MaRDI portal
(Redirected from Publication:383779)
Recommendations
Cites work
- scientific article; zbMATH DE number 5914869 (Why is no real title available?)
- scientific article; zbMATH DE number 4204378 (Why is no real title available?)
- scientific article; zbMATH DE number 3914359 (Why is no real title available?)
- scientific article; zbMATH DE number 3924825 (Why is no real title available?)
- scientific article; zbMATH DE number 3926957 (Why is no real title available?)
- scientific article; zbMATH DE number 3929043 (Why is no real title available?)
- scientific article; zbMATH DE number 3966120 (Why is no real title available?)
- scientific article; zbMATH DE number 4093495 (Why is no real title available?)
- scientific article; zbMATH DE number 3668667 (Why is no real title available?)
- scientific article; zbMATH DE number 3733974 (Why is no real title available?)
- scientific article; zbMATH DE number 3762094 (Why is no real title available?)
- scientific article; zbMATH DE number 21736 (Why is no real title available?)
- scientific article; zbMATH DE number 193589 (Why is no real title available?)
- scientific article; zbMATH DE number 3515497 (Why is no real title available?)
- scientific article; zbMATH DE number 3561382 (Why is no real title available?)
- scientific article; zbMATH DE number 3630799 (Why is no real title available?)
- scientific article; zbMATH DE number 482046 (Why is no real title available?)
- scientific article; zbMATH DE number 568815 (Why is no real title available?)
- scientific article; zbMATH DE number 3993619 (Why is no real title available?)
- scientific article; zbMATH DE number 853076 (Why is no real title available?)
- scientific article; zbMATH DE number 863469 (Why is no real title available?)
- scientific article; zbMATH DE number 863492 (Why is no real title available?)
- scientific article; zbMATH DE number 908781 (Why is no real title available?)
- scientific article; zbMATH DE number 1409214 (Why is no real title available?)
- scientific article; zbMATH DE number 3895104 (Why is no real title available?)
- scientific article; zbMATH DE number 3353326 (Why is no real title available?)
- scientific article; zbMATH DE number 3353327 (Why is no real title available?)
- scientific article; zbMATH DE number 4185649 (Why is no real title available?)
- 2‐neighborhoods and hamiltonian conditions
- A cycle structure theorem for Hamiltonian graphs
- A degree sum condition concerning the connectivity and the independence number of a graph
- A degree sum condition for longest cycles in 3-connected graphs
- A degree sum condition with connectivity for relative length of longest paths and cycles
- A generalization of Ore's Theorem involving neighborhood unions
- A generalization of a result of Häggkvist and Nicoghossian
- A lower bound for the circumference of a graph
- A method in graph theory
- A new sufficient condition for hamiltonian graphs
- A note on Hamiltonian circuits
- A note on a generalisation of Ore's condition
- A remark on Hamiltonian cycles
- A sufficient condition for all short cycles
- A σ_3 type condition for heavy cycles in weighted graphs
- Advances on the Hamiltonian problem -- a survey
- An Ore-type condition for pancyclability
- An implicit degree condition for Hamiltonian cycles
- An implicit degree condition for Hamiltonian graphs
- An implicit degree condition for cyclability in graphs
- An implicit degree condition for long cycles in 2-connected graphs
- An implicit degree condition for relative length of long paths and cycles in graphs
- An implicit weighted degree condition for heavy cycles
- Claw-free graphs---a survey
- Conditions for the Existence of Hamiltonian Circuits in Graphs Based on Vertex Degrees
- Cyclability of 3-connected graphs
- Cyclable sets of vertices in 3-connected graphs
- Cycles through prescribed vertices with large degree sum
- Cycles through specified vertices
- Cycles through subsets with large degree sums
- Dominating cycles in regular 3-connected graphs
- Edge disjoint Hamilton cycles in graphs
- Edge disjoint cycles in graphs
- Edge-Disjoint Hamilton Cycles in Regular Graphs of Large Degree
- Factorizations of regular graphs
- Graph theory with applications
- Hamilton cycles in 2-connected regular bipartite graphs
- Hamilton cycles in regular 2-connected graphs
- Hamilton cycles in regular 3-connected graphs
- Hamiltonian Cycles in Regular Graphs
- Hamiltonian graphs involving distances
- Hamiltonian graphs with neighborhood intersections
- Hamiltonicity of 4-connected graphs
- Hamiltonism, degree sum and neighborhood intersections
- Implicit-degrees and circumferences
- Large cycles in graphs
- Locally pancyclic graphs
- Long cycles in graphs with large degree sums
- Long path connectivity of regular graphs
- Longest cycles in 3-connected cubic graphs
- Longest cycles in 3-connected graphs
- Longest cycles in regular graphs
- Neighborhood unions and hamilton cycles
- New sufficient conditions for cycles in graphs
- Note on Hamilton Circuits
- On Hamilton's ideals
- On Maximal Circuits in Finite Graphs
- On a conjecture of Bondy
- On a conjecture of Woodall
- On cycles in 3-connected graphs
- On degree sum conditions for long cycles and cycles through specified vertices
- On relative length of longest paths and cycles
- On the existence of Hamiltonian cycles after removing edges
- Pancyclic graphs and a conjecture of Bondy and Chvatal
- Pancyclic graphs. I
- Pancyclism and small cycles in graphs
- Pancyclism in hamiltonian graphs
- Relative length of long paths and cycles in graphs with large degree sums
- Removable matchings and Hamiltonian cycles
- Sequences, claws and cyclability of graphs
- Small cycles in Hamiltonian graphs
- Some Theorems on Abstract Graphs
- The Geng-Hua Fan conditions for pancyclic or Hamilton-connected graphs
- The k-dominating cycles in graphs
- The binding number of a graph and its Anderson number
- Two sufficient conditions for dominating cycles
- Updating the hamiltonian problem—A survey
- Weakly pancyclic graphs
- Weakly pancyclic graphs
- Über Hamiltonsche Kreise und unabhängige Ecken in Graphen
Cited in
(37)- The cycle spectrum of claw-free Hamiltonian graphs
- On the difference between Hamilton cycles and 2-factors with a prescribed number of cycles
- A note on degree sum conditions for 2-factors with a prescribed number of cycles in bipartite graphs
- The robust component structure of dense regular graphs and applications
- Empirical Study of Phase Transition of Hamiltonian Cycle Problem in Random Graphs with Degrees Greater Than One
- On a Goodman-Hedetniemi sufficient condition for graph Hamiltonicity
- Cycle partitions of regular graphs
- scientific article; zbMATH DE number 4087693 (Why is no real title available?)
- Spanning trees with a bounded number of leaves
- scientific article; zbMATH DE number 1187334 (Why is no real title available?)
- A degree sum condition on the order, the connectivity and the independence number for Hamiltonicity
- Hamilton cycles in implicit claw-heavy graphs
- On Hamiltonicity of regular graphs with bounded second neighborhoods
- Hamilton-connected, vertex-pancyclic and bipartite holes
- 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
- Ore-type degree conditions for disjoint path covers in simple graphs
- Sufficient Conditions for a Connected Graph to Have a Hamiltonian Path
- Cyclability, connectivity and circumference
- A strengthening of Erdős-Gallai theorem and proof of Woodall's conjecture
- Hamiltonian paths, unit-interval complexes, and determinantal facet ideals
- Distributing pairs of vertices on Hamiltonian cycles
- Spectral conditions for graphs to be \(k\)-Hamiltonian or \(k\)-path-coverable
- 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
- Long paths in bipartite graphs and path-bistar bipartite Ramsey numbers
- Comparison of sufficient degree based conditions for Hamiltonian graph
- Circumference, minimum degree and clique number
- 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
- Dirac type condition and Hamiltonian-connected graphs
- Robust Hamiltonicity of Dirac graphs
- The Hamilton-connectivity with the degree sum of non-adjacent subgraphs of claw-free graphs
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)
