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

DOI10.1016/J.TCS.2011.05.020MaRDI QIDQ638544zbMATH OpenOpenAlexFDO

Authors Damian Bogdanowicz, Krzysztof Giaro, R. 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)

Recommendations

• Algorithmic complexity of list colorings
• scientific article; zbMATH DE number 1974594
• Publication:4934399
• List-coloring -- parameterizing from triviality
• On the complexity of a restricted list-coloring problem

Cites work

• scientific article; zbMATH DE number 1974594 (Why is no real title available?)
• scientific article; zbMATH DE number 1361465 (Why is no real title available?)
• Algorithmic complexity of list colorings
• Efficient list cost coloring of vertices and/or edges of bounded cyclicity graphs
• Generalized coloring for tree-like graphs
• Graph colorings with local constraints -- a survey
• On a multiconstrained model for chromatic scheduling
• On the complexity of a restricted list-coloring problem
• Some results concerning the complexity of restricted colorings of graphs
• The complexity of completing partial Latin squares

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

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