Track Layouts of Graphs

Abstract : A \emph(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 three-dimensional graph drawings. This paper presents the beginnings of a theory of track layouts. First we determine the maximum number of edges in a (k,t)-track layout, and show how to colour the edges given fixed linear orderings of the vertex colour classes. We then describe methods for the manipulation of track layouts. For example, we show how to decrease the number of edge colours in a track layout at the expense of increasing the number of tracks, and vice versa. We then study the relationship between track layouts and other models of graph layout, namely stack and queue layouts, and geometric thickness. One of our principle results is that the queue-number and track-number of a graph are tied, in the sense that one is bounded by a function of the other. As corollaries we prove that acyclic chromatic number is bounded by both queue-number and stack-number. Finally we consider track layouts of planar graphs. While it is an open problem whether planar graphs have bounded track-number, we prove bounds on the track-number of outerplanar graphs, and give the best known lower bound on the track-number of planar graphs.\
Type de document :
Article dans une revue
Discrete Mathematics and Theoretical Computer Science, DMTCS, 2004, 6 (2), pp.497-522
Liste complète des métadonnées

Littérature citée [51 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-00959023
Contributeur : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Soumis le : jeudi 13 mars 2014 - 17:06:46
Dernière modification le : mercredi 29 novembre 2017 - 10:26:20
Document(s) archivé(s) le : vendredi 13 juin 2014 - 12:15:47

Fichier

dm060221.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00959023, version 1

Collections

Citation

Vida Dujmović, Attila Pór, David Wood. Track Layouts of Graphs. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2004, 6 (2), pp.497-522. 〈hal-00959023〉

Partager

Métriques

Consultations de la notice

97

Téléchargements de fichiers

109