Injective edge coloring of some standard graph products

DOI10.1142/S1793830923500416MaRDI QIDQ6637040

B. S. Panda, Priyamvada

Publication date: 13 November 2024

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

zbMATH Keywords

Cartesian productlexicographic productMycielskiancorona productinjective edge coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• On the complexity of injective colorings and its generalizations
• Graph multiplication
• Induced and weak induced arboricities
• Note on the perfect EIC-graphs
• On the injective chromatic number of graphs
• Complexity and algorithms for injective edge-coloring in graphs
• Injective edge-coloring of graphs with given maximum degree
• List injective edge-coloring of subcubic graphs
• Note on injective edge-coloring of graphs
• Complexity and algorithms for neighbor-sum-2-distinguishing \(\{1,3\}\)-edge-weighting of graphs
• Injective coloring of some subclasses of bipartite graphs and chordal graphs
• \(L(2, 1)\)-labeling of the Cartesian and strong product of two directed cycles
• Injective edge coloring of sparse graphs
• On Injective Colourings of Chordal Graphs
• Sur le coloriage des graphs
• Injective edge coloring of graphs
• Exact square coloring of graphs resulting from some graph operations and products
• Injective edge-coloring of subcubic graphs
• Injective edge coloring of graphs with maximum degree 5

This page was built for publication: Injective edge coloring of some standard graph products

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6637040)