Generalized list colouring of graphs

DOI10.1007/S00373-021-02336-3MaRDI QIDQ2053679zbMATH OpenOpenAlexFDO

Authors Eun-Kyung Cho, Ilkyoo Choi, Yiting Jiang, Ringi Kim, Boram Park, Jiayan Yan, Xuding Zhu

Publication date 30 November 2021

Published in Graphs and Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

choice numberlist vertex arboricitygeneralized list colouringlist star arboricity

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Abstract: This paper disproves a conjecture of Wang, Wu, Yan and Xie, and answers in negative a question in Dvorak, Pekarek and Sereni. In return, we pose five open problems.

Recommendations

• On a list coloring conjecture of Reed
• scientific article; zbMATH DE number 25263
• Generalized list colourings of graphs
• Introduction to list colourings
• scientific article; zbMATH DE number 4134067

Cites work

• A weaker version of a conjecture on list vertex arboricity of graphs
• List point arboricity of dense graphs
• On generalized choice and coloring numbers

Cited in

(7)

• scientific article; zbMATH DE number 6000769 (Why is no real title available?)
• Partial list colouring of certain graphs
• Introduction to list colourings
• On a list coloring conjecture of Reed
• scientific article; zbMATH DE number 1341914 (Why is no real title available?)
• Generalized list \(T\)-colorings of cycles
• List-coloring embedded graphs

This page was built for publication: Generalized list colouring of graphs

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