Further results on 2-distance coloring of graphs

DOI10.1007/s10878-022-00942-2OpenAlexW4309300903MaRDI QIDQ2099385

Doost Ali Mojdeh, Babak Samadi

Publication date: 23 November 2022

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-022-00942-2

zbMATH Keywords

packingstrong productdirect product2-distance coloringrooted product

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Nordhaus-Gaddum-type relations of three graph coloring parameters
• A survey of Nordhaus-Gaddum type relations
• The \(k\)-distance chromatic number of trees and cycles
• A new graph product and its spectrum
• Towards a theory of domination in graphs
• Optimal approximation of sparse hessians and its equivalence to a graph coloring problem
• Domination in Graphs: Core Concepts
• 2-Distance chromatic number of some graph products
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Further results on 2-distance coloring of graphs