Edge-distinguishing index of a graph

DOI10.1007/S00373-013-1349-1MaRDI QIDQ489314zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Rafał Kalinowski, Mariusz Woźniak

Publication date 20 January 2015

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

Copyright license Creative Commons Attribution 4.0 International

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

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

Recommendations

• Distinguishing graphs by edge-colourings
• On the neighbour-distinguishing index of a graph
• scientific article; zbMATH DE number 4095491
• The distinguishing index of connected graphs without pendant edges
• The chromatic distinguishing index of certain graphs

Cites work

• scientific article; zbMATH DE number 907924 (Why is no real title available?)
• scientific article; zbMATH DE number 2229032 (Why is no real title available?)
• On the vertex-distinguishing proper edge-colorings of graphs
• Packing circuits into K_N.
• Vertex distinguishing colorings of graphs with \(\Delta(G)=2\)
• Vertex-distinguishing edge colorings of graphs
• Vertex-distinguishing proper edge-colorings

Cited in

(7)

• scientific article; zbMATH DE number 4095491 (Why is no real title available?)
• ‎Distinguishing index of Kronecker product of two graphs
• The edge-distinguishing chromatic number of petal graphs, chorded cycles, and spider graphs
• Edge motion and the distinguishing index
• scientific article; zbMATH DE number 2204182 (Why is no real title available?)
• On neighbour-distinguishing colourings from lists
• The edge-distinguishing chromatic number of spider graphs with three legs or bounded leg lengths

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q489314)