Every Graph Admits an Unambiguous Bold Drawing

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-25878-7_32
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg


Related search