Adjacent vertex distinguishing edge-colorings and total-colorings of the lexicographic product of graphs
From MaRDI portal
Publication:2341729
DOI10.1016/j.dam.2014.11.028zbMath1310.05101OpenAlexW1970386865MaRDI QIDQ2341729
Publication date: 28 April 2015
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2014.11.028
edge-coloringlexicographic producttotal-coloringadjacent vertex distinguishing total-coloringadjacent vertex distinguishing edge-coloring
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the neighbour-distinguishing index of a graph
- \(r\)-strong edge colorings of graphs
- Adjacent vertex-distinguishing edge and total chromatic numbers of hypercubes
- Adjacent strong edge coloring of graphs
- Total colourings of graphs
- On the adjacent vertex-distinguishing total chromatic numbers of the graphs with \(\Delta (G) = 3\)
- \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
- On adjacent-vertex-distinguishing total coloring of graphs
- Adjacent Vertex Distinguishing Edge‐Colorings