Note on property \(M(k)\) of some complete multipartite graphs

DOI10.1016/j.ipl.2014.09.017zbMath1304.05054OpenAlexW2091664057MaRDI QIDQ477636

Xuguang Zhang, Yanning Wang, Yan-yan Wang

Publication date: 9 December 2014

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2014.09.017

zbMATH Keywords

graph algorithmlist coloringcomplete multipartite graphsproperty \(M(k)\)

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Complexity of unique list colorability
• Defining sets in vertex colorings of graphs and latin rectangles
• Some conclusion on unique \(k\)-list colorable complete multipartite graphs
• Note on Characterization of Uniquely 3-List Colorable Complete Multipartite Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Note on property \(M(k)\) of some complete multipartite graphs