Acyclic edge colourings of graphs with large girth
نویسندگان
چکیده
منابع مشابه
Generalised acyclic edge colourings of graphs with large girth
An edge colouring of a graph G is called acyclic if it is proper and every cycle contains at least three colours. We show that for every ε > 0, there exists a g = g(ε) such that if G has girth at least g then G admits an acyclic edge colouring with at most (1 + ε)∆ colours.
متن کاملAcyclic Colourings of Planar Graphs with Large Girth
An acyclic colouring of a graph G is a proper vertex-colouring of G such that every union of two colour classes induces an acyclic subgraph of G, and χ a ̄ χ a (G) denotes the smallest number of colours in an acyclic colouring of G. Clearly χ a (C ) ̄ 3 if C is a cycle and χ a (F )% 2 if F is a forest, with equality unless F is edgeless. For a planar graph G, Gru$ nbaum [5] conjectured that χ a (...
متن کاملAbout acyclic edge colourings of planar graphs
Let G = (V,E) be any finite simple graph. A mapping C : E → [k] is called an acyclic edge k-colouring of G, if any two adjacent edges have different colours and there are no bichromatic cycles in G. In other words, for every pair of distinct colours i and j, the subgraph induced by all the edges which have either colour i or j is acyclic. The smallest number k of colours, such that G has an acy...
متن کاملTotal Colourings of Planar Graphs with Large Girth
The total chromatic number χ ′′ = χ ′′(G) of a graph G is the smallest number of colours that suffice to colour the vertices and edges of G so that no two adjacent or incident elements have the same colour. It is clear that χ ′′ ≥ 1+1, and Behzad [1] and Vizing [14] conjectured that χ ′′ ≤ 1 + 2, for every graph G with maximum degree 1. This conjecture was verified by Rosenfeld [12] and Vijayad...
متن کاملA note on n-tuple colourings and circular colourings of planar graphs with large odd girth
International Journal of Computer Mathematics Publication details, including instructions for authors and subscription information: http://www.informaworld.com/smpp/title~content=t713455451 A note on n-tuple colourings and circular colourings of planar graphs with large odd girth P. šparl ab; J. žerovnik ac a IMFM, Slovenia b FG, University of Maribor, Slovenia c FS, University of Maribor, Slov...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Random Structures & Algorithms
سال: 2016
ISSN: 1042-9832
DOI: 10.1002/rsa.20695