An algebraic criterion for the choosability of graphs
From MaRDI portal
Publication:2345516
DOI10.1007/s00373-014-1411-7zbMath1312.05046OpenAlexW2092921973MaRDI QIDQ2345516
Dariush Kiani, Farhad Rahmati, Somayeh Moradi, Fatemeh Mohammadi, Saieed Akbari
Publication date: 22 May 2015
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-014-1411-7
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- List colouring when the chromatic number is close to the order of the graph
- On two generalizations of the Alon-Tarsi polynomial method
- Colorings and orientations of graphs
- Choice number of some complete multi-partite graphs
- Choosability of powers of circuits
- On the choosability of complete multipartite graphs with part size three
- A relation between choosability and uniquely list colorability
- On chromatic‐choosable graphs
- A Proof of a Conjecture of Ohba
This page was built for publication: An algebraic criterion for the choosability of graphs