Some concepts in list coloring
| dc.creator | Eslahchi, Ch. | |
| dc.creator | Ghebleh, M. | |
| dc.creator | Hajiabolhassan, H. | |
| dc.date | 1999-06-02 | |
| dc.date | 2008-01-02 | |
| dc.date.accessioned | 2026-07-07T08:51:45Z | |
| dc.date.available | 2026-07-07T08:51:45Z | |
| dc.description | In this paper uniquely list colorable graphs are studied. A graph G is called to be uniquely k-list colorable if it admits a k-list assignment from which G has a unique list coloring. The minimum k for which G is not uniquely k-list colorable is called the M-number of G. We show that every triangle-free uniquely vertex colorable graph with chromatic number k+1, is uniquely k-list colorable. A bound for the M-number of graphs is given, and using this bound it is shown that every planar graph has M-number at most 4. Also we introduce list criticality in graphs and characterize all 3-list critical graphs. It is conjectured that every $χ_\ell$-critical graph is $χ'$-critical and the equivalence of this conjecture to the well known list coloring conjecture is shown. | |
| dc.identifier | https://arxiv.org/abs/math/9906011 | |
| dc.identifier | http://arxiv.org/abs/math/9906011 | |
| dc.identifier | Journal of Combinatorial Mathematics and Combinatorial Computing 41 (2002), 151-160 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/145046 | |
| dc.subject | Combinatorics | |
| dc.subject | 05C15 | |
| dc.title | Some concepts in list coloring | |
| dc.type | text |