Advanced search
1 file | 520.78 KB Add to list

Hamiltonian properties of polyhedra with few 3-cuts : a survey

(2018) DISCRETE MATHEMATICS. 341(9). p.2646-2660
Author
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
    • |
    • PDF
    • |
    • 520.78 KB

Citation

Please use this url to cite or link to this publication:

MLA
Ozeki, Kenta, et al. “Hamiltonian Properties of Polyhedra with Few 3-Cuts : A Survey.” DISCRETE MATHEMATICS, vol. 341, no. 9, 2018, pp. 2646–60, doi:10.1016/j.disc.2018.06.015.
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. https://doi.org/10.1016/j.disc.2018.06.015
Chicago author-date
Ozeki, Kenta, Nicolas Van Cleemput, and Carol Zamfirescu. 2018. “Hamiltonian Properties of Polyhedra with Few 3-Cuts : A Survey.” DISCRETE MATHEMATICS 341 (9): 2646–60. https://doi.org/10.1016/j.disc.2018.06.015.
Chicago author-date (all authors)
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. doi:10.1016/j.disc.2018.06.015.
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.
IEEE
[1]
K. Ozeki, N. Van Cleemput, and C. Zamfirescu, “Hamiltonian properties of polyhedra with few 3-cuts : a survey,” DISCRETE MATHEMATICS, vol. 341, no. 9, pp. 2646–2660, 2018.
@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: