Colorability in Orthogonal Graph Drawing
Work
Year: 2008
Type: book-chapter
Abstract: This paper studies the question: What is the maximum integer k b,n such that every k b,n-colorable graph has a b-bend n-dimensional orthogonal box drawing?We give an exact answer for the orthogonal li... more
Source: Graph Drawing
Author Jan Štola
Institution Charles University
Cites: 9
Cited by: 2
Related to: 10
FWCI: 0.591
Citation percentile (by year/subfield): 57.33
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze