scientific article; zbMATH DE number 4019095
From MaRDI portal
Publication:3030852
An \(L_ s\)-colouring of a graph G is a colouring of the vertices for which vertices at distance \(\leq s\) from each other receive different colours. An \(L_{r,s}\)-colouring is one such that every path of length s has at least \(r+1\) vertices with distinct colours. \(M_ s\)-colourings and \(M_{r,s}\)-colourings of digraphs are defined analogously to the above colourings for undirected graphs. This paper gives a number of theorems concerning these concepts and their application to certain kinds of graphs and digraphs.
Recommendations
Cited in
(7)- On the Number of Synchronizing Colorings of Digraphs
- scientific article; zbMATH DE number 4019094 (Why is no real title available?)
- scientific article; zbMATH DE number 3847419 (Why is no real title available?)
- scientific article; zbMATH DE number 4075088 (Why is no real title available?)
- scientific article; zbMATH DE number 4085675 (Why is no real title available?)
- scientific article; zbMATH DE number 722293 (Why is no real title available?)
- scientific article; zbMATH DE number 2063896 (Why is no real title available?)
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 Q3030852)