Geometric thickness of complete graphs

Journal of Graph Algorithms and Applications

Volumn 4, Issue 3, 2000, Pages 5-17

  Dillencourt, Michael B ^a   Eppstein, David ^a   Hirschberg, Daniel S ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0344095526     PISSN: 15261719     EISSN: None     Source Type: Journal    
DOI: 10.7155/jgaa.00023     Document Type: Conference Paper

References (19)

1. V. B. Alekseev and V. S. Gončakov. The thickness of an arbitrary complete graph. Math USSR Sbornik, 30(2):187-202, 1976.
2. L. W. Beineke. The decomposition of complete graphs into planar sub-graphs. In F. Harary, editor, Graph Theory and Theoretical Physics, chapter 4, pages 139-153. Academic Press, London, UK, 1967.
3. L. W. Beineke. Biplanar graphs: a survey. Computers & Mathematics with Applications, 34(11):1-8, December 1997.
4. L. W. Beineke and F. Harary. The thickness of the complete graph. Canadian Journal of Mathematics, 17:850-859, 1965.
5. F. Bernhart and P. C. Kainen. The book thickness of a graph. Journal of Combinatorial Theory Series B, 27:320-331, 1979.
6. D. Bienstock. Some provably hard crossing number problems. Discrete & Computational Geometry, 6(5):443-459, 1991.
7. D. Bienstock and N. Dean. Bounds for rectilinear crossing numbers. Journal of Graph Theory, 17(3):333-348, 1993.
8. R. Cimikowski. On heuristics for determining the thickness of a graph. Information Sciences, 85:87-98, 1995.
9. A. M. Dean, J. P. Hutchinson, and E. R. Scheinerman. On the thickness and arboricity of a graph. Journal of Combinatorial Theory Series B, 52:147-151, 1991.
10. J. H. Halton. On the thickness of graphs of given degree. Information Sciences, 54:219-238, 1991.
11. F. Harary and A. Hill. On the number of crossings in a complete graph. Proc. Edinburgh Math Soc., 13(2):333-338, 1962/1963.
12. N. Hartsfield and G. Ringel. Pearls in Graph Theory. Academic Press, Boston, MA, 1990.
13. J. P. Hutchinson, T. Shermer, and A. Vince. On representation of some thickness-two graphs. In F. J. Brandenburg, editor, Symposium on Graph Drawing (GD '95), pages 324-332, Passau, Germany, September 1995. Springer-Verlag Lecture Notes in Computer Science 1027.
14. B. Jackson and G. Ringel. Plane constructions for graphs, networks, and maps: Measurements of planarity. In G. Hammer and P. D, editors, Selected Topics in Operations Research and Mathematical Economics: Proceedings of the 8th Symposium on Operations Research, pages 315-324, Karlsruhe, West Germany, August 1983. Springer-Verlag Lecture Notes in Economics and Mathematical Systems 226.
15. P. C. Kainen. Thickness and coarseness of graphs. Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg, 39:88-95, 1973.
16. A. Mansfield. Determining the thickness of a graph is NP-hard. Mathematical Proceedings of the Cambridge Philosophical Society, 93(9):9-23, 1983.
17. 16 en trois graphes planaires. Journal of Combinatorial Theory Series B, 13:71, 1972.
18. J. Pach and G. Tóth. Which crossing number is it, anyway? In Proceedings of the 39th Annual IEEE Symposium on the Foundations of Computer Science, pages 617-626, Palo Alto, CA, November 1998.
19. J. Vasak. The thickness of the complete graph having 6m + 4 points. Manuscript. Cited in [12, 14].