An implicit degree condition for \(k\)-connected 2-heavy graphs to be Hamiltonian (Q1707969): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Large cycles in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dirac's minimum degree condition restricted to claws / 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: Hamilton cycles in implicit 2-heavy graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2829008 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on Hamiltonian circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Essential independent sets and Hamiltonian cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Theorems on Abstract Graphs / 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: Implicit degree condition for Hamiltonicity of 2-heavy 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: Implicit-degrees and circumferences / rank
 
Normal rank

Revision as of 09:27, 15 July 2024

scientific article
Language Label Description Also known as
English
An implicit degree condition for \(k\)-connected 2-heavy graphs to be Hamiltonian
scientific article

    Statements

    An implicit degree condition for \(k\)-connected 2-heavy graphs to be Hamiltonian (English)
    0 references
    0 references
    0 references
    0 references
    4 April 2018
    0 references
    combinatorial problems
    0 references
    implicit degree
    0 references
    2-heavy
    0 references
    essential independent set
    0 references
    Hamilton cycle
    0 references

    Identifiers