4-connected triangulations and 4-orderedness
From MaRDI portal
Publication:708369
DOI10.1016/j.disc.2010.04.026zbMath1209.05135MaRDI QIDQ708369
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
Related Items
Cites Work
- Unnamed Item
- 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
- Survey of results on \(k\)-ordered graphs