Note on 2-connected graphs with \(d(u)+d(v)\geq n-4\) (Q1169481): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Heinz A. Jung / rank
Normal rank
 
Property / author
 
Property / author: Chie Nara / rank
Normal rank
 
Property / author
 
Property / author: Heinz A. Jung / rank
 
Normal rank
Property / author
 
Property / author: Chie Nara / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Maximal Circuits in Finite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3921268 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on Hamilton Circuits / rank
 
Normal rank

Latest revision as of 16:55, 13 June 2024

scientific article
Language Label Description Also known as
English
Note on 2-connected graphs with \(d(u)+d(v)\geq n-4\)
scientific article

    Statements

    Note on 2-connected graphs with \(d(u)+d(v)\geq n-4\) (English)
    0 references
    0 references
    1982
    0 references
    0 references
    Ore-condition
    0 references
    Hamilton cycle
    0 references
    0 references
    0 references