A note on traversing specified vertices in graphs embedded with large representativity
From MaRDI portal
Publication:709309
DOI10.1016/j.disc.2010.03.025zbMath1214.05093OpenAlexW1990360550MaRDI QIDQ709309
Michael D. Plummer, Ken-ichi Kawarabayashi
Publication date: 18 October 2010
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2010.03.025
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- When m vertices in a k-connected graph cannot be walked round along a simple cycle
- A nine point theorem for 3-connected graphs
- Five-coloring maps on surfaces
- Trees in triangulations
- 4-connected projective planar graphs are Hamiltonian
- Five-connected toroidal graphs are Hamiltonian
- Color-critical graphs on a fixed surface
- Long cycles in graphs on a fixed surface
- A theorem on paths in locally planar triangulations
- Cycles through 23 vertices in 3-connected cubic planar graphs
- On the matching extendability of graphs in surfaces
- Hamiltonian circuits in some maps on the torus
- Disjoint paths, planarizing cycles, and spanning walks
- A Theorem on Planar Graphs
- In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
- Hamiltonicity of 5‐Connected Toroidal Triangulations
- Polytopes, graphs, and complexes
- On Cycles and Connectivity in Planar Graphs
- A theorem on paths in planar graphs
This page was built for publication: A note on traversing specified vertices in graphs embedded with large representativity
