Track Layouts of Graphs
A (k,t)-track layout of a graph G consists of a (proper) vertex t-colouring of G, a total order of each vertex colour class, and a (non-proper) edge k-colouring such that between each pair of colour classes no two monochromatic edges cross. This structure has recently arisen in the study of...
Main Authors: | Vida Dujmović, Attila Pór, David R. Wood |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2004-12-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Online Access: | http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/204 |
Similar Items
-
Track layouts of graphs
by: Dujmović, Vida
Published: (2003) -
Stacks, Queues and Tracks: Layouts of Graph Subdivisions
by: Vida Dujmović, et al.
Published: (2005-12-01) -
On Linear Layouts of Graphs
by: Vida Dujmović, et al.
Published: (2004-12-01) -
Queue Layouts of Graph Products and Powers
by: David R. Wood
Published: (2005-12-01) -
The Perception of Graph Properties In Graph Layouts
Published: (2018)