Crossref
Geometric Thickness of Complete Graphs
Journal of Graph Algorithms and Applications · 2000 · 4 (3) · 5-17
DOI: 10.7155/jgaa.00023 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Graph Algorithms and Applications, 2000. Verfasst von Michael B. Dillencourt und 2 weiteren Autor:innen. Die Arbeit wurde bisher 48-mal zitiert (Crossref).
Abstract (Originalsprache)
Kein Abstract verfügbar.
Zitieren
APA
Dillencourt, M. B., Eppstein, D., & Hirschberg, D. S. (2000). Geometric Thickness of Complete Graphs. Journal of Graph Algorithms and Applications, 4(3), 5-17. https://doi.org/10.7155/jgaa.00023
Vancouver
Dillencourt MB, Eppstein D, Hirschberg DS. Geometric Thickness of Complete Graphs. Journal of Graph Algorithms and Applications. 2000;4(3):5-17. doi:10.7155/jgaa.00023
BibTeX
@article{Dillencourt2000,
author = {Dillencourt, Michael B. and Eppstein, David and Hirschberg, Daniel S.},
title = {Geometric Thickness of Complete Graphs},
journal = {Journal of Graph Algorithms and Applications},
year = {2000},
volume = {4},
number = {3},
pages = {5--17},
doi = {10.7155/jgaa.00023}
}
EUVIMED