Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey (Q383779): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Conditions for the Existence of Hamiltonian Circuits in Graphs Based on Vertex Degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pancyclism in hamiltonian graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5187317 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040392 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of a result of Häggkvist and Nicoghossian / rank
 
Normal rank
Property / cites work
 
Property / cites work: Long cycles in graphs with large degree sums / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3820627 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Geng-Hua Fan conditions for pancyclic or Hamilton-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4094891 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3866156 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über Hamiltonsche Kreise und unabhängige Ecken in Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871771 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles through specified vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian Cycles in Regular Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weakly pancyclic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large cycles in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pancyclic graphs. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871748 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4192100 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A method in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sufficient condition for all short cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weakly pancyclic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles through subsets with large degree sums / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4888104 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of Ore's Theorem involving neighborhood unions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5397240 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4940054 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian graphs involving distances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian graphs with neighborhood intersections / rank
 
Normal rank
Property / cites work
 
Property / cites work: An implicit degree condition for long cycles in 2-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Hamilton's ideals / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on Hamiltonian circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Theorems on Abstract Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4274436 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relative length of long paths and cycles in graphs with large degree sums / rank
 
Normal rank
Property / cites work
 
Property / cites work: New sufficient conditions for cycles in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Longest cycles in regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pancyclism and small cycles in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Claw-free graphs---a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3981351 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3701452 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequences, claws and cyclability of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Ore-type condition for pancyclability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonism, degree sum and neighborhood intersections / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on a generalisation of Ore's condition / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a conjecture of Bondy / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new sufficient condition for hamiltonian graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Updating the hamiltonian problem—A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances on the Hamiltonian problem -- a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3944634 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3691770 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A remark on Hamiltonian cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclability of 3-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4722095 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Removable matchings and Hamiltonian cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-Disjoint Hamilton Cycles in Regular Graphs of Large Degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton cycles in regular 2-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Longest cycles in 3-connected cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neighborhood unions and hamilton cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton cycles in 2-connected regular bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating cycles in regular 3-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Maximal Circuits in Finite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge disjoint cycles in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge disjoint Hamilton cycles in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cycles in 3-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a conjecture of Woodall / rank
 
Normal rank
Property / cites work
 
Property / cites work: An implicit degree condition for relative length of long paths and cycles in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An implicit weighted degree condition for heavy cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Implicit Degree Condition for Cyclability in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An implicit degree condition for Hamiltonian graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2811716 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonicity of 4-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(k\)-dominating cycles in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4294607 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton cycles in regular 3-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclable sets of vertices in 3-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for the circumference of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4868770 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two sufficient conditions for dominating cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3921268 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5628163 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5628162 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on Hamilton Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles through prescribed vertices with large degree sum / rank
 
Normal rank
Property / cites work
 
Property / cites work: On relative length of longest paths and cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: A degree sum condition concerning the connectivity and the independence number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small cycles in Hamiltonian graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pancyclic graphs and a conjecture of Bondy and Chvatal / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cycle structure theorem for Hamiltonian graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3699724 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3353047 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2‐neighborhoods and hamiltonian conditions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locally pancyclic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3011709 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Longest cycles in 3-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The binding number of a graph and its Anderson number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4134010 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A degree sum condition for longest cycles in 3-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On degree sum conditions for long cycles and cycles through specified vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A degree sum condition with connectivity for relative length of longest paths and cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: A σ_3 type condition for heavy cycles in weighted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Long path connectivity of regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factorizations of regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5750889 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implicit-degrees and circumferences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3703923 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3734438 / rank
 
Normal rank

Latest revision as of 03:54, 7 July 2024

scientific article
Language Label Description Also known as
English
Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey
scientific article

    Statements

    Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey (English)
    0 references
    0 references
    6 December 2013
    0 references
    0 references
    Hamiltonian graph
    0 references
    degree
    0 references
    implicit degree
    0 references
    circumference
    0 references
    cyclable
    0 references
    pancyclic
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references