2-tone coloring of graphs with maximum degree 4

zbMATH Open1395.05037MaRDI QIDQ4576336FDOQ4576336

Authors: Jiuying Dong 

Publication date: 12 July 2018

Recommendations

• New results in \(t\)-tone coloring of graphs
• An upper bound for the 3-tone chromatic number of graphs with maximum degree 3
• The \(t\)-tone chromatic number of random graphs
• scientific article; zbMATH DE number 7731183
• \(t\)-tone colorings in the Cartesian product

zbMATH Keywords

maximum degree\(t\)-tone chromatic number\(t\)-tone \(k\)-coloring

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15)

Cited In (10)

• Title not available (Why is that?)
• An upper bound for the 3-tone chromatic number of graphs with maximum degree 3
• Every 4-colorable graph with maximum degree 4 has an equitable 4-coloring
• 2-tone colorings in graph products
• 2-tone coloring of chordal and outerplanar graphs
• The \(t\)-tone chromatic number of random graphs
• 2-tone coloring of cactus graphs
• \(t\)-tone colorings in the Cartesian product
• \(t\)-tone colorings of graphs
• New results in \(t\)-tone coloring of graphs

This page was built for publication: 2-tone coloring of graphs with maximum degree 4

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