Adjacent vertex-distinguishing edge and total chromatic numbers of hypercubes

DOI10.1016/j.ipl.2009.02.006zbMath1197.05045OpenAlexW1977294862MaRDI QIDQ987834

Meirun Chen, Xiaofeng Guo

Publication date: 16 August 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2009.02.006

zbMATH Keywords

edge coloringhypercubesinterconnection networkstotal coloringadjacent vertex-distinguishing edge coloringadjacent vertex-distinguishing edge chromatic numberadjacent vertex-distinguishing total chromatic numberadjacent vertex-distinguishing total coloring

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)

Related Items

Adjacent vertex distinguishing total coloring in split graphs, Adjacent vertex distinguishing edge-colorings and total-colorings of the Cartesian product of graphs, Adjacent vertex-distinguishing edge colorings of \(K_{4}\)-minor free graphs, AVD-total-chromatic number of some families of graphs with \(\Delta(G) = 3\), On the total and AVD-total coloring of graphs, General vertex-distinguishing total coloring of graphs, Adjacent vertex distinguishing edge-colorings and total-colorings of the lexicographic product of graphs, AVD-total-colouring of complete equipartite graphs, \(d\)-strong total colorings of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• On the neighbour-distinguishing index of a graph
• \(r\)-strong edge colorings of graphs
• On the vertex-distinguishing proper edge-colorings of graphs
• Asymptotic behaviour of the observability of \(Q_ n\)
• Adjacent strong edge coloring of graphs
• \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
• On adjacent-vertex-distinguishing total coloring of graphs
• Vertex-distinguishing proper edge-colorings
• Adjacent Vertex Distinguishing Edge‐Colorings