Back to Search
Start Over
List circular backbone colouring.
- Source :
-
Discrete Mathematics & Theoretical Computer Science (DMTCS) . 2014, Vol. 16 Issue 1, p89-104. 16p. - Publication Year :
- 2014
-
Abstract
- A natural generalization of graph colouring involves taking colours from a metric space and insisting that the end-points of an edge receive colours separated by a minimum distance dictated by properties of the edge. In the q-backbone colouring problem, these minimum distances are either q or 1, depending on whether or not the edge is in the backbone. In this paper we consider the list version of this problem, with particular focus on colours in Zp - this problem is closely related to the problem of circular choosability. We first prove that the list circular q-backbone chromatic number of a graph is bounded by a function of the list chromatic number. We then consider the more general problem in which each edge is assigned an individual distance between its endpoints, and provide bounds using the Combinatorial Nullstellensatz. Through this result and through structural approaches, we achieve good bounds when both the graph and the backbone belong to restricted families of graphs. [ABSTRACT FROM AUTHOR]
- Subjects :
- *GRAPH theory
*GRAPHIC methods
*METRIC spaces
*COMBINATORICS
*MATHEMATICAL mappings
Subjects
Details
- Language :
- English
- ISSN :
- 13658050
- Volume :
- 16
- Issue :
- 1
- Database :
- Academic Search Index
- Journal :
- Discrete Mathematics & Theoretical Computer Science (DMTCS)
- Publication Type :
- Academic Journal
- Accession number :
- 95268472