A note on 3-connected cubic planar graphs (Q973135): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1026774
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.disc.2010.03.010 / rank
Normal rank
 
Property / author
 
Property / author: Xiao-Yun Lu / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2010.03.010 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2033879878 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Long cycles in 3-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The smallest non-Hamiltonian 3-connected cubic planar graphs have 38 vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple paths on polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Hamiltonian Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theorem on Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4389325 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DISC.2010.03.010 / rank
 
Normal rank

Latest revision as of 10:43, 10 December 2024

scientific article
Language Label Description Also known as
English
A note on 3-connected cubic planar graphs
scientific article

    Statements

    A note on 3-connected cubic planar graphs (English)
    0 references
    28 May 2010
    0 references
    longest cycle
    0 references
    3-connected cubic planar graph
    0 references
    Hamilton cycle
    0 references
    Hamiltonian
    0 references
    non-Hamiltonian
    0 references
    Tutte fragment
    0 references
    0 references

    Identifiers