Adjacent vertex distinguishing edge-colorings and total-colorings of the Cartesian product of graphs
DOI10.3934/naco.2014.4.49zbMath1283.05111OpenAlexW2317994305MaRDI QIDQ2438328
Ping Chen, Yabin Shao, Qian Wang, Shuangliang Tian
Publication date: 11 March 2014
Published in: Numerical Algebra, Control and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/naco.2014.4.49
edge-coloringCartesian producttotal-coloringadjacent vertex distinguishing total-coloringadjacent vertex distinguishing edge-coloring
Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graph operations (line graphs, products, etc.) (05C76)
Related Items (1)
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
This page was built for publication: Adjacent vertex distinguishing edge-colorings and total-colorings of the Cartesian product of graphs