Implicit degree condition for Hamiltonicity of 2-heavy graphs (Q505434): 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: Q5422499 / 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: Q3211339 / 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: Q4862340 / 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: Pairs of Heavy Subgraphs for Hamiltonicity of 2-Connected Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fan-type degree condition restricted to triples of induced subgraphs ensuring Hamiltonicity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on Hamilton Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implicit-degrees and circumferences / rank
 
Normal rank

Revision as of 07:30, 13 July 2024

scientific article
Language Label Description Also known as
English
Implicit degree condition for Hamiltonicity of 2-heavy graphs
scientific article

    Statements

    Implicit degree condition for Hamiltonicity of 2-heavy graphs (English)
    0 references
    0 references
    23 January 2017
    0 references
    implicit degree
    0 references
    Hamilton cycle
    0 references
    \(f\)-implicit-heavy graph
    0 references
    2-heavy graph
    0 references

    Identifiers