Non-hamiltonian \(5 \over 4\)-tough maximal planar graphs (Q1910531): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Tough graphs and Hamiltonian circuits. / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound on the shortness exponent of 1-tough, maximal planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortness exponents of families of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 1-tough nonhamiltonian maximal planar graph / rank
 
Normal rank

Latest revision as of 11:14, 24 May 2024

scientific article
Language Label Description Also known as
English
Non-hamiltonian \(5 \over 4\)-tough maximal planar graphs
scientific article

    Statements

    Non-hamiltonian \(5 \over 4\)-tough maximal planar graphs (English)
    0 references
    0 references
    0 references
    24 March 1996
    0 references
    0 references
    non-hamiltonian graph
    0 references
    shortness exponent
    0 references
    maximal planar graphs
    0 references
    toughness
    0 references