29 search results - page 1 / 6 » About acyclic edge colourings of planar graphs |
IPL
2008
13 years 6 months ago
2008
Book
A well-written book about graph theory.
AAIM
2007
Springer
14 years 4 days ago
2007
Springer
An acyclic edge colouring of a graph is a proper edge colouring having no 2-coloured cycle, that is, a colouring in which the union of any two colour classes forms a linear forest...
COLOGNETWENTE
2009
13 years 7 months ago
2009
Given a graph G = (V, E), a proper vertex colouring of V is t-frugal if no colour appears more than t times in any neighbourhood and is acyclic if each of the bipartite graphs con...
COCOON
2006
Springer
13 years 9 months ago
2006
Springer
We determine the values of the acyclic chromatic index of a class of graphs referred to as d-dimensional partial tori. These are graphs which can be expressed as the cartesian prod...