L(2,1)-colorings and irreducible no-hole colorings of the direct product of graphs

DOI10.1016/J.DAM.2018.05.036MaRDI QIDQ2181256zbMATH OpenOpenAlexFDO

Authors Nibedita Mandal, Pratima Panigrahi

Publication date 18 May 2020

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2018.05.036

zbMATH Keywords

\(L(2,1)\)-coloringdirect 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) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• \(L(2,1)\)-colorings and irreducible no-hole colorings of Cartesian product of graphs
• L(2, 1)-coloring and irreducible no-hole coloring of lexicographic product of graphs
• On irreducible no-hole L(2, 1)-coloring of Cartesian product of trees with paths
• Solutions of some L(2, 1)-coloring related open problems
• Irreducible no-hole \(L(2, 1)\)-coloring of edge-multiplicity-paths-replacement graph

Cites work

• \(L(2,1)\)-labeling of direct product of paths and cycles
• L(2,1)-labeling of Kneser graphs and coloring squares of Kneser graphs
• L(2,1)-labelings on the modular product of two graphs
• L(2,1)-labelling of generalized prisms
• A survey on labeling graphs with a condition at distance two
• Distance two labelling and direct products of graphs
• Full Color Theorems for L(2,1)-Colorings
• Holes in L(2,1)-coloring on certain classes of graphs
• scientific article; zbMATH DE number 5764899 (Why is no real title available?)
• Irreducibility of L(2,1)-colorings and the inh-colorability of unicyclic and hex graphs
• Labelling Graphs with a Condition at Distance 2
• New \(L(j,k)\)-labelings for direct products of complete graphs
• No-hole \(L(2,1)\)-colorings
• On irreducible no-hole L(2, 1)-labelings of hypercubes and triangular lattices
• On irreducible no-hole \(L(2,1)\)-coloring of subdivision of graphs
• On irreducible no‐hole L(2, 1)‐coloring of trees
• On the \(L(p,1)\)-labelling of graphs
• On the irreducible no-hole L(2,1) coloring of bipartite graphs and Cartesian products
• Optimal \(L(d,1)\)-labelings of certain direct products of cycles and Cartesian products of cycles
• Solutions of some L(2, 1)-coloring related open problems
• The \(\Delta ^{2}\)-conjecture for \(L(2,1)\)-labelings is true for total graphs
• The \(L(2,1)\)-labeling on Cartesian sum of graphs
• The \(L(2,1)\)-labeling on the skew and converse skew products of graphs
• The L(2,1)-labeling and operations of graphs
• Variations of graph coloring, domination, and combinations of both: a brief survey

Cited in

(4)

• \(L(2,1)\)-colorings and irreducible no-hole colorings of Cartesian product of graphs
• On the universality and extremality of graphs with a distance constrained colouring
• On irreducible no-hole L(2, 1)-coloring of Cartesian product of trees with paths
• L(2, 1)-coloring and irreducible no-hole coloring of lexicographic product of graphs

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

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