scientific article; zbMATH DE number 7731183

zbMATH Open1519.05073MaRDI QIDQ6134964FDOQ6134964

Authors Daniel W. Cranston

Publication date 23 August 2023

Full work available at URL https://arxiv.org/abs/2212.00610

zbMATH Keywords

proper vertex coloring\(t\)-tone \(k\)-coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Density (toughness, etc.) (05C42)

Recommendations

• The \(t\)-tone chromatic number of random graphs
• New results in \(t\)-tone coloring of graphs
• \(t\)-tone colorings of graphs
• 2-tone coloring of graphs with maximum degree 4
• An upper bound for the 3-tone chromatic number of graphs with maximum degree 3

Cites work

• scientific article; zbMATH DE number 6277727 (Why is no real title available?)
• scientific article; zbMATH DE number 2188336 (Why is no real title available?)
• 2-tone coloring of graphs with maximum degree 4
• 2-tone colorings in graph products
• A lower bound for the \(t\)-tone chromatic number of a graph in terms of Wiener index
• An upper bound for the 3-tone chromatic number of graphs with maximum degree 3
• Covering planar graphs with forests
• Light graphs in families of outerplanar graphs
• New results in \(t\)-tone coloring of graphs
• The \(t\)-tone chromatic number of random graphs
• \(t\)-tone colorings in the Cartesian product
• \(t\)-tone colorings of graphs

Cited in

(9)

• 2-tone coloring of chordal and outerplanar graphs
• 2-tone coloring of cactus graphs
• New results in \(t\)-tone coloring of graphs
• The \(t\)-tone chromatic number of random graphs
• 2-tone coloring of graphs with maximum degree 4
• An upper bound for the 3-tone chromatic number of graphs with maximum degree 3
• A Combinatorial Classic — Sparse Graphs with High Chromatic Number
• A lower bound for the \(t\)-tone chromatic number of a graph in terms of Wiener index
• \(t\)-tone colorings of graphs

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 Q6134964)