Distant Vertex Partitions of Graphs

DOI10.1017/S0963548398003654MaRDI QIDQ4238171zbMATH OpenOpenAlexFDO

Authors Chris Jagger

Publication date 10 April 2000

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0963548398003654

zbMATH Keywords

chromatic numberdistance coloring

Mathematics Subject Classification ID

Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15) Extremal problems in graph theory (05C35)

Recommendations

• scientific article; zbMATH DE number 1186100
• The k-distance chromatic number of trees and cycles
• Vertex colorings with a distance restriction
• scientific article; zbMATH DE number 3884195
• The distance coloring of graphs

Cited in

(5)

• Vertex colorings with a distance restriction
• A survey on the distance-colouring of graphs
• scientific article; zbMATH DE number 1186100 (Why is no real title available?)
• Vertex partitions of metric spaces with finite distance sets
• The distance coloring of graphs

This page was built for publication: Distant Vertex Partitions of Graphs

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