Consensus models: computational complexity aspects in modern approaches to the list coloring problem

DOI10.1016/j.tcs.2011.05.020zbMath1221.68100OpenAlexW1997349421MaRDI QIDQ638544

Damian Bogdanowicz, Krzysztof Giaro, Robert Janczewski

Publication date: 12 September 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.05.020

zbMATH Keywords

treelist coloringconsensus modelsedge list coloring

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• The complexity of completing partial Latin squares
• Some results concerning the complexity of restricted colorings of graphs
• On a multiconstrained model for chromatic scheduling
• On the complexity of a restricted list-coloring problem
• Algorithmic complexity of list colorings
• Generalized coloring for tree-like graphs
• Efficient list cost coloring of vertices and/or edges of bounded cyclicity graphs
• Graph colorings with local constraints -- a survey

This page was built for publication: Consensus models: computational complexity aspects in modern approaches to the list coloring problem