Name
Abstract | ||
|---|---|---|
A proper edge colouring of a graph G is neighbour-distinguishing provided that it distinguishes adjacent vertices by sets of colours of their incident edges. It is proved that for any planar bipartite graph G with Δ(G)≥12 there is a neighbour-distinguishing edge colouring of G using at most Δ(G)+1 colours. Colourings distinguishing pairs of vertices that satisfy other requirements are also considered. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1007/s00373-006-0671-2 | Graphs and Combinatorics |
Keywords | Field | DocType |
neighbour-distinguishing index,adjacent vertex,neighbour-distinguishing edge,planar bipartite graph,graph g,incident edge,proper edge,bipartite graph,satisfiability | Topology,Discrete mathematics,Combinatorics,Edge-transitive graph,Graph power,Bound graph,Gray graph,Neighbourhood (graph theory),Cycle graph,Semi-symmetric graph,Mathematics,Complement graph | Journal |
Volume | Issue | ISSN |
22 | 3 | 1435-5914 |
Citations | PageRank | References |
35 | 2.37 | 11 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Keith Edwards | 1 | 73 | 6.46 |
| Mirko Horňák | 2 | 127 | 16.28 |
| Mariusz Woźniak | 3 | 204 | 34.54 |