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

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Peter J. Owens / rank
Normal rank
 
Property / author
 
Property / author: Peter J. Owens / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
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
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0012-365x(94)00177-k / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2033228454 / rank
 
Normal rank

Latest revision as of 10:38, 30 July 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
    0 references