Further results on 2-distance coloring of graphs
From MaRDI portal
Publication:2099385
Recommendations
Cites work
- 2-distance chromatic number of some graph products
- 2-distance coloring of strong product of graphs
- A new graph product and its spectrum
- A survey of Nordhaus-Gaddum type relations
- Domination in Graphs: Core Concepts
- Handbook of product graphs
- scientific article; zbMATH DE number 3482387 (Why is no real title available?)
- scientific article; zbMATH DE number 1286740 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 3265667 (Why is no real title available?)
- scientific article; zbMATH DE number 3308991 (Why is no real title available?)
- Nordhaus-Gaddum-type relations of three graph coloring parameters
- Optimal approximation of sparse hessians and its equivalence to a graph coloring problem
- The k-distance chromatic number of trees and cycles
- Towards a theory of domination in graphs
Cited in
(11)- 2-distance colorings of some direct products of paths and cycles
- scientific article; zbMATH DE number 6613416 (Why is no real title available?)
- 2-distance coloring of strong product of graphs
- The 2-distance chromatic number of Cartesian product of graphs
- scientific article; zbMATH DE number 844150 (Why is no real title available?)
- scientific article; zbMATH DE number 2188369 (Why is no real title available?)
- A note on 2-distance chromatic numbers of graphs
- 2-distance chromatic number of some graph products
- Distance-2 Coloring in the CONGEST Model
- 2-distance coloring of sparse graphs
- e-injective coloring: 2-distance and injective coloring conjectures
This page was built for publication: Further results on 2-distance coloring of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2099385)