4-connected triangulations and 4-orderedness

DOI10.1016/j.disc.2010.04.026zbMath1209.05135OpenAlexW2049161889MaRDI QIDQ708369

Raiji Mukae, Kenta Ozeki

Publication date: 11 October 2010

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2010.04.026

zbMATH Keywords

4-orderedtriangulations of a surface

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40)

Related Items (3)

Every 5-connected planar triangulation is 4-ordered Hamiltonian ⋮ 7-connected graphs are 4-ordered ⋮ Connectivity for Kite-Linked Graphs

Cites Work

• Disjoint paths in graphs
• 2-linked graphs
• An improved linear edge bound for graph linkages
• 4-connected maximal planar graphs are 4-ordered
• On 3-regular 4-ordered graphs
• A Polynomial Solution to the Undirected Two Paths Problem
• Non-existence of graph embeddings
• Degree conditions for k‐ordered hamiltonian graphs
• k-ordered Hamiltonian graphs
• Survey of results on \(k\)-ordered graphs

This page was built for publication: 4-connected triangulations and 4-orderedness