scientific article; zbMATH DE number 1560505

MaRDI QIDQ4527276zbMATH OpenFDO

Authors Alexander Kononov, Sergey Sevastyanov

Publication date 4 February 2001

zbMATH Keywords

complexityconnected coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Publication:4934399
• Algorithmic complexity of list colorings
• On the complexity of a restricted list-coloring problem
• The complexity of determining the rainbow vertex-connection of a graph
• scientific article; zbMATH DE number 1396705

Cited in

(6)

• An introduction to multi-parameter complexity analysis of discrete problems
• scientific article; zbMATH DE number 6007698 (Why is no real title available?)
• Efficient list cost coloring of vertices and/or edges of bounded cyclicity graphs
• scientific article; zbMATH DE number 1744077 (Why is no real title available?)
• scientific article; zbMATH DE number 1396705 (Why is no real title available?)
• Exploring the complexity boundary between coloring and list-coloring

This page was built for publication:

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