Vertex-distinguishing proper arc colorings of digraphs

DOI10.1016/J.DAM.2015.10.039zbMath1339.05140OpenAlexW2273752530MaRDI QIDQ298989

Qiang Sun, Hao Li, Yan Dong Bai, Wei-Hua He

Publication date: 21 June 2016

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

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

zbMATH Keywords

digraphsbalanced arc coloringsequitable arc coloringsvertex-distinguishing arc colorings

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)

Related Items (3)

A note on the neighbour-distinguishing index of digraphs ⋮ On generalisations of the AVD conjecture to digraphs ⋮ Proper distinguishing arc-colourings of symmetric digraphs

Cites Work

• On the vertex-distinguishing proper edge-colorings of graphs
• Embedding an incomplete diagonal latin square in a complete diagonal latin square
• Balanced edge colorings.
• Vertex distinguishing colorings of graphs with \(\Delta(G)=2\)
• The observability of the Fibonacci and the Lucas cubes
• The list chromatic index of a bipartite multigraph
• Vertex-distinguishing proper edge colourings of some regular graphs
• Vertex-distinguishing proper edge-colorings
• Vertex‐distinguishing edge colorings of random graphs
• A note on the vertex-distinguishing proper coloring of graphs with large minimum degree
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Vertex-distinguishing proper arc colorings of digraphs