scientific article; zbMATH DE number 1802818

MaRDI QIDQ3147263zbMATH OpenFDO

Authors Changiz Eslahchi, Hossein Hajiabolhassan, M. Ghebleh

Publication date 12 November 2002

Full work available at URL https://arxiv.org/abs/math/9906011

zbMATH Keywords

list colorable graphslist critical graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Review text

In this paper the uniquely list colorable graphs and the list critical graphs are discussed. It is proved that every triangle-free uniquely \((k+1)\)-colorable graph is uniquely \(k\)-list colorable (Theorem 1), and every planar graph has \(m\)-number at most 4 (Theorem 5). Furthermore, all 3-list critical graphs are characterized (Theorem 7). It is conjectured that every \(\chi'_l\)-critical graph is \(\chi'\)-critical and the equivalence of this conjecture to the well-known list coloring conjecture is proved, which is very interesting and valuable. By the way, the authors say that it seems that if \(f(v) = k\) for each vertex \(v\) of graph \(G\), the equality in Theorem 2 does not hold. But they do not provide the proof strictly.

Recommendations

• On the conjecture of U3LC planar graphs
• A uniquely 3-list colorable, planar and \(K_4\)-free graph
• Disproof of a conjecture on list coloring
• scientific article; zbMATH DE number 2187705
• Uniquely 2-list colorable graphs

Cited in

(6)

• Uniquely 2-list colorable graphs
• On uniquely \(k\)-list colorable planar graphs, graphs on surfaces, and regular graphs
• On the conjecture of U3LC planar graphs
• Note on property M(k) of some complete multipartite graphs
• Some Conjectures and Questions in Chromatic Topological Graph Theory
• Complexity of unique list colorability

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3147263)