Two counterexamples in graph drawing

MaRDI QIDQ4414514zbMATH OpenFDO

Authors Ondrej Sýkora, László A. Székely, Imrich Vrt'o

Publication date 25 July 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2573/25730391.htm

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• A note on Halton's conjecture
• scientific article; zbMATH DE number 3957136
• scientific article; zbMATH DE number 1156579
• On the maximum crossing number
• Graph treewidth and geometric thickness parameters

Cited in

(1)

• A note on Halton's conjecture

This page was built for publication: Two counterexamples in graph drawing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4414514)