On a connection between the existence of k-trees and the toughness of a graph (Q1120590)

From MaRDI portal
Revision as of 11:04, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On a connection between the existence of k-trees and the toughness of a graph
scientific article

    Statements

    On a connection between the existence of k-trees and the toughness of a graph (English)
    0 references
    0 references
    1989
    0 references
    toughness
    0 references
    spanning tree
    0 references
    Hamiltonian path
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references