Various results on the toughness of graphs (Q4254359): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
label / enlabel / en
 
Various results on the toughness of graphs
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of recognizing tough graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The square of a block is Hamiltonian connected / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tough graphs and Hamiltonian circuits. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on Hamiltonian circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toughness and the existence ofk-factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: The square of every two-connected graph is Hamiltonian / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on Hamilton Circuits / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199905)33:3<233::aid-net9>3.0.co;2-a / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2147146290 / rank
 
Normal rank
Property / title
 
Various results on the toughness of graphs (English)
Property / title: Various results on the toughness of graphs (English) / rank
 
Normal rank

Latest revision as of 11:45, 30 July 2024

scientific article; zbMATH DE number 1310284
Language Label Description Also known as
English
Various results on the toughness of graphs
scientific article; zbMATH DE number 1310284

    Statements

    0 references
    0 references
    0 references
    29 June 1999
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    degree sum condition
    0 references
    toughness
    0 references
    minimally \(t\)-tough
    0 references
    squares
    0 references
    0 references
    Various results on the toughness of graphs (English)
    0 references