Separating geometric thickness from book thickness
David Eppstein
arXiv.org e-Print archive, math.CO/0109195
Cited by:
Track layouts of graphs
Graph treewidth and geometric thickness parameters
Bounded-degree graphs have arbitrarily large geometric thickness
[
D. Eppstein publications
] [
Citation database
] [
Documents
]
Fano
Experimental Web Server,
D. Eppstein
,
School of Information & Computer Science
,
UC Irvine
