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

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
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

Revision as of 20:43, 2 July 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