Name
Abstract | ||
|---|---|---|
We introduce a concept of edge-distinguishing colourings of graphs. A closed neighbourhood of an edge $${e\in E(G)}$$ e E ( G ) is a subgraph N [ e ] induced by e and all edges adjacent to it. We say that a colouring c : E ( G ) C does not distinguish two edges e 1 and e 2 if there exists an isomorphism of N [ e 1] onto N [ e 2] such that ( e 1) = e 2 and preserves colours of c . An edge-distinguishing index of a graph G is the minimum number of colours in a proper colouring which distinguishes every two distinct edges of G . We determine the edge-distinguishing index for cycles, paths and complete graphs. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1007/s00373-013-1349-1 | Graphs and Combinatorics |
Keywords | Field | DocType |
chromatic index,euler tours in multigraphs,proper edge colouring | Discrete mathematics,Edge coloring,Topology,Graph,Combinatorics,Existential quantification,Isomorphism,Mathematics | Journal |
Volume | Issue | ISSN |
30 | 6 | 1435-5914 |
Citations | PageRank | References |
0 | 0.34 | 4 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Rafał Kalinowski | 1 | 48 | 10.75 |
| Mariusz Woźniak | 2 | 204 | 34.54 |