Efficient computation of the modular chromatic numbers of trees

MaRDI QIDQ2839730zbMATH OpenFDO

Authors Futaba Fujie, Todd G. Will

Publication date 12 July 2013

Published in JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing (Search for Journal in Brave)

zbMATH Keywords

chromatic numbermodular coloring

Mathematics Subject Classification ID

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

Recommendations

• On closed modular colorings of trees
• On the chromatic number of tree graphs
• On closed modular colorings of rooted trees
• On modular chromatic indexes of graphs
• Graph-Theoretic Concepts in Computer Science
• Computing the Treewidth and the Minimum Fill-in with the Modular Decomposition
• Computing the treewidth and the minimum fill-in with the modular decomposition
• Almost linear time computation of the chromatic polynomial of a graph of bounded tree-width
• Efficient computation of the oriented chromatic number of recursively defined digraphs

Cited in

(5)

• On closed modular colorings of trees
• On characterizations of trees having large \((2, 0)\)-chromatic numbers
• On closed modular colorings of rooted trees
• A checkerboard problem and modular colorings of graphs
• On modular colorings of caterpillars

This page was built for publication: Efficient computation of the modular chromatic numbers of trees

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