Injective coloring of some graph operations
type: Item
instance of: scholarly article
title: Injective coloring of some graph operations
zbMATH Open document ID: 1410.05074
author: Jiamei Song
author: Jun Yue
published in: Applied Mathematics and Computation
publication date: 2018-08-22T00:00:00Z
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 6923416
zbMATH Keywords: Cartesian product
zbMATH Keywords: direct product
zbMATH Keywords: graph operation
zbMATH Keywords: injective chromatic operation
zbMATH Keywords: lexicographic product
Wikidata QID: Q114211053
MaRDI profile type: Publication
full work available at URL: j.amc.2015.03.124
OpenAlex ID: W268513908
cites work: Q5422499
cites work: The complexity of determining the rainbow vertex-connection of a graph
cites work: Injective colorings of sparse graphs
cites work: On the injective chromatic number of graphs
cites work: On Injective Colourings of Chordal Graphs
cites work: Note on the hardness of rainbow connections for planar and line graphs
cites work: Rainbow connections for outerplanar graphs with diameter 2 and 3
cites work: The hyper-Wiener index of graph operations
cites work: The strong rainbow vertex-connection of graphs
cites work: Rainbow connection in 3-connected graphs
cites work: On the rainbow vertex-connection
cites work: Rainbow connections of graphs: a survey
cites work: Coloring the square of a \(K_{4}\)-minor free graph
cites work: A bound on the chromatic number of the square of a planar graph
cites work: An improved upper bound for the neighbor sum distinguishing index of graphs
DOI: 10.1016/J.AMC.2015.03.124
description: scientific article; zbMATH DE number 6923416