Vertex colorings with a distance restriction
From MaRDI portal
(Redirected from Publication:1584412)
Recommendations
Cites work
- Acyclic colorings of planar graphs
- Brève communication. Sur le nombre chromatique K(p, G) des graphes
- Distant Vertex Partitions of Graphs
- scientific article; zbMATH DE number 3968609 (Why is no real title available?)
- scientific article; zbMATH DE number 4089545 (Why is no real title available?)
- 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
(15)- The k-distance chromatic number of trees and cycles
- Dominated colorings of graphs
- A survey on the distance-colouring of graphs
- scientific article; zbMATH DE number 3884195 (Why is no real title available?)
- Special study in (2,3)-distance coloring and (2,3)-distance graphs
- Distance Coloring
- Distant Vertex Partitions of Graphs
- On strict strong coloring of graphs
- On the double total dominator chromatic number of graphs
- Some results on the distance r-b-coloring in graphs
- Construction of sparse graphs with prescribed circular colorings
- A characterization of star-perfect graphs
- An extensive study on the k-tuple total dominator chromatic number of graphs
- Some properties of star-perfect graphs
- A strict strong coloring of trees
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)