Every 5-connected planar triangulation is 4-ordered Hamiltonian (Q307916): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonhamiltonian triangulations with large connectivity and representativity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Survey of results on \(k\)-ordered graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: 4-connected maximal planar graphs are 4-ordered / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple paths on polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: 4-connected triangulations and 4-orderedness / rank
 
Normal rank
Property / cites work
 
Property / cites work: 4-connected projective-planar graphs are Hamiltonian-connected / 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: Trees in triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theorem on Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint paths, planarizing cycles, and spanning walks / rank
 
Normal rank

Latest revision as of 13:24, 12 July 2024

scientific article
Language Label Description Also known as
English
Every 5-connected planar triangulation is 4-ordered Hamiltonian
scientific article

    Statements

    Identifiers