On characterizations of trees having large (2, 0)-chromatic numbers

zbMATH Open1342.05023MaRDI QIDQ2809943FDOQ2809943

Authors: Eric Andrews, Chira Lumduanhom, Ping Zhang 

Publication date: 30 May 2016

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

Recommendations

• On modular monochromatic \((2,0)\)-colorings
• On monochromatic frames in graphs
• On monochromatic spectra in graphs
• On modular monochromatic colorings of graphs
• Efficient computation of the modular chromatic numbers of trees

zbMATH Keywords

modularmonochromatic coloring\((2, 0)\)-chromatic number\((2, 0)\)-minimal and \((2, 0)\)-extremal trees

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15) Structural characterization of families of graphs (05C75)

Cited In (3)

• On modular colorings of caterpillars
• Extremal trees with respect to number of \((A, B, 2 C)\)-edge colourings
• Title not available (Why is that?)

This page was built for publication: On characterizations of trees having large \((2, 0)\)-chromatic numbers

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