On the 1-fault Hamiltonicity for graphs satisfying Ore's theorem (Q456147): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A degree characterisation of pancyclicity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Not every 2-tough graph is Hamiltonian / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pancyclic graphs. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear forests and ordered cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree sum conditions for Hamiltonicity on \(k\)-partite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Theorems on Abstract Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Onk-ordered graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree conditions for <i>k</i>‐ordered hamiltonian graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree sums, \(k\)-factors and Hamilton cycles in graphs / 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: A comprehensive analysis of degree based condition for Hamiltonian cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Removable matchings and 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: Cubic planar Hamiltonian graphs of various types / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault-free mutually independent Hamiltonian cycles of faulty star graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge disjoint cycles in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new sufficient condition for hamiltonicity of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fan-type result on \(k\)-ordered graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient condition for a graph to be Hamiltonian / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved degree based condition for Hamiltonian cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: k-ordered Hamiltonian graphs / 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 Hamiltonian cycles and Hamiltonian paths / rank
 
Normal rank

Latest revision as of 20:02, 5 July 2024

scientific article
Language Label Description Also known as
English
On the 1-fault Hamiltonicity for graphs satisfying Ore's theorem
scientific article

    Statements

    On the 1-fault Hamiltonicity for graphs satisfying Ore's theorem (English)
    0 references
    0 references
    0 references
    0 references
    23 October 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    combinatorial problems
    0 references
    degree
    0 references
    Ore's theorem
    0 references
    Hamiltonian
    0 references
    1-fault Hamiltonian
    0 references
    0 references