Bounded-degree graphs can have arbitrarily large slope numbers.
Pach, János; Pálvölgyi, Dömötör
The Electronic Journal of Combinatorics [electronic only] (2006)
- Volume: 13, Issue: 1, page Research paper N1, 4 p., electronic only-Research paper N1, 4 p., electronic only
- ISSN: 1077-8926
Access Full Article
top
How to cite
topPach, János, and Pálvölgyi, Dömötör. "Bounded-degree graphs can have arbitrarily large slope numbers.." The Electronic Journal of Combinatorics [electronic only] 13.1 (2006): Research paper N1, 4 p., electronic only-Research paper N1, 4 p., electronic only. <http://eudml.org/doc/125523>.
@article{Pach2006,
author = {Pach, János, Pálvölgyi, Dömötör},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {straight-line drawing of graphs; geometric graphs; slope number of graphs; slope number},
language = {eng},
number = {1},
pages = {Research paper N1, 4 p., electronic only-Research paper N1, 4 p., electronic only},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {Bounded-degree graphs can have arbitrarily large slope numbers.},
url = {http://eudml.org/doc/125523},
volume = {13},
year = {2006},
}
TY - JOUR
AU - Pach, János
AU - Pálvölgyi, Dömötör
TI - Bounded-degree graphs can have arbitrarily large slope numbers.
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 N1, 4 p., electronic only
EP - Research paper N1, 4 p., electronic only
LA - eng
KW - straight-line drawing of graphs; geometric graphs; slope number of graphs; slope number
UR - http://eudml.org/doc/125523
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.