On uniquely list colorable graphs
| dc.creator | Ghebleh, M. | |
| dc.creator | Mahmoodian, E. S. | |
| dc.date | 1999-06-02 | |
| dc.date.accessioned | 2026-07-07T08:51:45Z | |
| dc.date.available | 2026-07-07T08:51:45Z | |
| dc.description | Let G be a graph with n vertices and suppose that for each vertex v in G, there exists a list of k colors L(v), such that there is a unique proper coloring for G from this collection of lists, then G is called a uniquely k-list colorable graph. Recently M. Mahdian and E.S. Mahmoodian characterized uniquely 2-list colorable graphs. Here we state some results which will pave the way in characterization of uniquely k-list colorable graphs. There is a relationship between this concept and defining sets in graph colorings and critical sets in latin squares. | |
| dc.description | 13 pages | |
| dc.identifier | https://arxiv.org/abs/math/9906009 | |
| dc.identifier | http://arxiv.org/abs/math/9906009 | |
| dc.identifier | Ars Combinatoria 59 (2001), 307-318 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/145045 | |
| dc.subject | Combinatorics | |
| dc.title | On uniquely list colorable graphs | |
| dc.type | text |