\(L(2,1)\)-colorings and irreducible no-hole colorings of Cartesian product of graphs

DOI10.1016/j.endm.2017.11.031zbMath1383.05111OpenAlexW2772336518MaRDI QIDQ2413382

Nibedita Mandal, Pratima Panigrahi

Publication date: 10 April 2018

Full work available at URL: https://doi.org/10.1016/j.endm.2017.11.031

zbMATH Keywords

Cartesian product of graphsirreducible coloringno-hole coloringspan of a graph

Mathematics Subject Classification ID

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

Related Items (1)

On irreducible no-hole L(2, 1)-coloring of Cartesian product of trees with paths

Cites Work

• Unnamed Item
• Unnamed Item
• \(L(2,1)\)-labelling of generalized prisms
• Relating path coverings to vertex labellings with a condition at distance two
• No-hole \(L(2,1)\)-colorings
• On \(L(2,1)\)-labelings of Cartesian products of paths and cycles
• \(L(2,1)\)-labelings of Cartesian products of two cycles
• Optimal \(L(d,1)\)-labelings of certain direct products of cycles and Cartesian products of cycles
• Labeling Products of Complete Graphs with a Condition at Distance Two
• On Irreducible No-hole L(2, 1)-labelings of Hypercubes and Triangular Lattices
• Labelling Graphs with a Condition at Distance 2
• The L(2,1)-labeling and operations of graphs
• On the $\lambda$-Number of $Q_n $ and Related Graphs
• THE λ-NUMBER OF THE CARTESIAN PRODUCT OF A COMPLETE GRAPH AND A CYCLE
• On irreducible no‐hole L(2, 1)‐coloring of trees

This page was built for publication: \(L(2,1)\)-colorings and irreducible no-hole colorings of Cartesian product of graphs