Edge-distinguishing index of a graph

DOI10.1007/s00373-013-1349-1zbMath1306.05063OpenAlexW2071347433WikidataQ59398965 ScholiaQ59398965MaRDI QIDQ489314

Mariusz Woźniak, Rafał Kalinowski

Publication date: 20 January 2015

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-013-1349-1

zbMATH Keywords

chromatic indexEuler tours in multigraphsproper edge colouring

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• On the vertex-distinguishing proper edge-colorings of graphs
• Vertex distinguishing colorings of graphs with \(\Delta(G)=2\)
• Packing Circuits into K_N
• Vertex-distinguishing proper edge-colorings
• Vertex-distinguishing edge colorings of graphs

This page was built for publication: Edge-distinguishing index of a graph