Vertex colorings with a distance restriction

DOI10.1016/S0012-365X(98)00094-6MaRDI QIDQ1584412zbMATH OpenFDO

Authors Guantao Chen, András Gyárfás, R. H. Schelp

Publication date 2 November 2000

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

distancechromatic numbercolorings

Mathematics Subject Classification ID

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

Recommendations

• Distance Coloring
• The k-distance chromatic number of trees and cycles
• On Distance Coloring
• scientific article; zbMATH DE number 2201392
• 2-distance coloring of sparse graphs

Cites work

• scientific article; zbMATH DE number 3968609 (Why is no real title available?)
• scientific article; zbMATH DE number 4089545 (Why is no real title available?)
• Acyclic colorings of planar graphs
• Brève communication. Sur le nombre chromatique $K(p, G)$ des graphes
• Distant Vertex Partitions of Graphs
• On some properties of 4‐regular plane graphs
• On the \(d\)-distance face chromatic number of plane graphs
• Ond-diagonal colorings
• Some maximum multigraphs and adge/vertex distance colourings

Cited in

(12)

• The k-distance chromatic number of trees and cycles
• Distance Coloring
• Construction of sparse graphs with prescribed circular colorings
• On the double total dominator chromatic number of graphs
• Dominated colorings of graphs
• Some results on the distance \(r\)-\(b\)-coloring in graphs
• A strict strong coloring of trees
• A characterization of star-perfect graphs
• scientific article; zbMATH DE number 3884195 (Why is no real title available?)
• On strict strong coloring of graphs
• A survey on the distance-colouring of graphs
• Special study in \((2,3)\)-distance coloring and \((2,3)\)-distance graphs

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

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