Uniquely 2-List Colorable Graphs

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

A graph is called to be uniquely list colorable, if it admits a list assignment which induces a unique list coloring. We study uniquely list colorable graphs with a restriction on the number of colors used. In this way we generalize a theorem which characterizes uniquely 2-list colorable graphs. We introduce the uniquely list chromatic number of a graph and make a conjecture about it which is a generalization of the well known Brooks' theorem.

Keywords

Combinatorics, 05C15

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/145048

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/9906187
 http://arxiv.org/abs/math/9906187
 Discrete Appl. Math. 119 (2002), no. 3, 217--225

Collections

arXiv