Injective coloring of some graph operations

DOI10.1016/j.amc.2015.03.124zbMath1410.05074OpenAlexW268513908WikidataQ114211053 ScholiaQ114211053MaRDI QIDQ1659655

Jiamei Song, Jun Yue

Publication date: 22 August 2018

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2015.03.124

zbMATH Keywords

Cartesian productdirect productgraph operationlexicographic productinjective chromatic operation

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (3)

Injective coloring of some subclasses of bipartite graphs and chordal graphs ⋮ Injective coloring of graphs revisited ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Rainbow connections for outerplanar graphs with diameter 2 and 3
• Rainbow connection in 3-connected graphs
• An improved upper bound for the neighbor sum distinguishing index of graphs
• The complexity of determining the rainbow vertex-connection of a graph
• Injective colorings of sparse graphs
• The hyper-Wiener index of graph operations
• Coloring the square of a \(K_{4}\)-minor free graph
• On the injective chromatic number of graphs
• Rainbow connections of graphs: a survey
• Note on the hardness of rainbow connections for planar and line graphs
• A bound on the chromatic number of the square of a planar graph
• On the rainbow vertex-connection
• The strong rainbow vertex-connection of graphs
• On Injective Colourings of Chordal Graphs

This page was built for publication: Injective coloring of some graph operations