Hamiltonian properties of polyhedra with few 3-cuts : a survey
- Author
- Kenta Ozeki, Nicolas Van Cleemput (UGent) and Carol Zamfirescu (UGent)
- Organization
- Keywords
- Planar, 3-connected, Polyhedron, Triangulation, Decomposition tree, Hamiltonian, Traceable, Hamiltonian-connected, MAXIMAL PLANAR GRAPH, SEPARATING TRIANGLES, HYPOTRACEABLE GRAPHS, CYCLES, TRIANGULATIONS, PATHS, THEOREM, NUMBER, VERTICES
Downloads
-
(...).pdf
- full text
- |
- UGent only
- |
- |
- 520.78 KB
Citation
Please use this url to cite or link to this publication: http://hdl.handle.net/1854/LU-8567556
- Chicago
- Ozeki, Kenta, Nicolas Van Cleemput, and Carol Zamfirescu. 2018. “Hamiltonian Properties of Polyhedra with Few 3-cuts : a Survey.” Discrete Mathematics 341 (9): 2646–2660.
- APA
- Ozeki, K., Van Cleemput, N., & Zamfirescu, C. (2018). Hamiltonian properties of polyhedra with few 3-cuts : a survey. DISCRETE MATHEMATICS, 341(9), 2646–2660.
- Vancouver
- 1.Ozeki K, Van Cleemput N, Zamfirescu C. Hamiltonian properties of polyhedra with few 3-cuts : a survey. DISCRETE MATHEMATICS. 2018;341(9):2646–60.
- MLA
- Ozeki, Kenta, Nicolas Van Cleemput, and Carol Zamfirescu. “Hamiltonian Properties of Polyhedra with Few 3-cuts : a Survey.” DISCRETE MATHEMATICS 341.9 (2018): 2646–2660. Print.
@article{8567556,
author = {Ozeki, Kenta and Van Cleemput, Nicolas and Zamfirescu, Carol},
issn = {0012-365X},
journal = {DISCRETE MATHEMATICS},
keywords = {Planar,3-connected,Polyhedron,Triangulation,Decomposition tree,Hamiltonian,Traceable,Hamiltonian-connected,MAXIMAL PLANAR GRAPH,SEPARATING TRIANGLES,HYPOTRACEABLE GRAPHS,CYCLES,TRIANGULATIONS,PATHS,THEOREM,NUMBER,VERTICES},
language = {eng},
number = {9},
pages = {2646--2660},
title = {Hamiltonian properties of polyhedra with few 3-cuts : a survey},
url = {http://dx.doi.org/10.1016/j.disc.2018.06.015},
volume = {341},
year = {2018},
}
- Altmetric
- View in Altmetric
- Web of Science
- Times cited: