Bounded-degree graphs have arbitrarily large geometric thickness.
Barát, János; Matoušek, Jirí; Wood, David R.
The Electronic Journal of Combinatorics [electronic only] (2006)
- Volume: 13, Issue: 1, page Research paper R3, 14 p., electronic only-Research paper R3, 14 p., electronic only
- ISSN: 1077-8926
Access Full Article
top
How to cite
topBarát, János, Matoušek, Jirí, and Wood, David R.. "Bounded-degree graphs have arbitrarily large geometric thickness.." The Electronic Journal of Combinatorics [electronic only] 13.1 (2006): Research paper R3, 14 p., electronic only-Research paper R3, 14 p., electronic only. <http://eudml.org/doc/125522>.
@article{Barát2006,
author = {Barát, János, Matoušek, Jirí, Wood, David R.},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {straight-line drawing of graphs; geometric graphs; geometric thickness; slope number},
language = {eng},
number = {1},
pages = {Research paper R3, 14 p., electronic only-Research paper R3, 14 p., electronic only},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {Bounded-degree graphs have arbitrarily large geometric thickness.},
url = {http://eudml.org/doc/125522},
volume = {13},
year = {2006},
}
TY - JOUR
AU - Barát, János
AU - Matoušek, Jirí
AU - Wood, David R.
TI - Bounded-degree graphs have arbitrarily large geometric thickness.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2006
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 13
IS - 1
SP - Research paper R3, 14 p., electronic only
EP - Research paper R3, 14 p., electronic only
LA - eng
KW - straight-line drawing of graphs; geometric graphs; geometric thickness; slope number
UR - http://eudml.org/doc/125522
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.