Hamiltonian cycles through prescribed edges of 4-connected maximal planar graphs (Q968420): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On Hamiltonian cycles in 4- and 5-connected plane triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On certain Hamiltonian cycles in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4947393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a cycle through a specified linear forest of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of Tutte's theorem on Hamiltonian cycles in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3129827 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 4-connected projective planar graphs are Hamiltonian / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theorem on paths in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theorem on Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bridges and Hamiltonian circuits in planar graphs / rank
 
Normal rank

Revision as of 18:48, 2 July 2024

scientific article
Language Label Description Also known as
English
Hamiltonian cycles through prescribed edges of 4-connected maximal planar graphs
scientific article

    Statements

    Hamiltonian cycles through prescribed edges of 4-connected maximal planar graphs (English)
    0 references
    0 references
    0 references
    5 May 2010
    0 references
    maximal planar graph
    0 references
    Hamiltonian cycle
    0 references
    prescribed edges
    0 references

    Identifiers