Vertex colorings with a distance restriction

DOI10.1016/S0012-365X(98)00094-6zbMath0958.05053MaRDI QIDQ1584412

Guantao Chen, András Gyárfás, Richard H. Schelp

Publication date: 2 November 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

distancechromatic numbercolorings

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)

Related Items (4)

On the double total dominator chromatic number of graphs ⋮ A strict strong coloring of trees ⋮ On strict strong coloring of graphs ⋮ Dominated colorings of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• On the \(d\)-distance face chromatic number of plane graphs
• Distant Vertex Partitions of Graphs
• Some maximum multigraphs and adge/vertex distance colourings
• On some properties of 4‐regular plane graphs
• Ond-diagonal colorings
• Brève communication. Sur le nombre chromatique $K(p, G)$ des graphes
• Acyclic colorings of planar graphs

This page was built for publication: Vertex colorings with a distance restriction