The generalized acyclic edge chromatic number of random regular graphs
نویسندگان
چکیده
The r-acyclic edge chromatic number of a graph is defined to be the minimum number of colours required to produce an edge colouring of the graph such that adjacent edges receive different colours and every cycle C has at least min(|C|, r) colours. We show that (r − 2)d is asymptotically almost surely (a.a.s.) an upper bound on the r-acyclic edge chromatic number of a random d-regular graph, for all constants r ≥ 4 and d ≥ 2.
منابع مشابه
The generalised acyclic edge chromatic number of random regular graphs
The r-acyclic edge chromatic number of a graph is defined to be the minimum number of colours required to produce an edge colouring of the graph such that adjacent edges receive different colours and every cycle C has at least min(|C|, r) colours. We show that (r − 2)d is asymptotically almost surely (a.a.s.) an upper bound on the r-acyclic edge chromatic number of a random d-regular graph, for...
متن کاملA new approach to compute acyclic chromatic index of certain chemical structures
An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The acyclic chromatic index of a graph $G$ denoted by $chi_a '(G)$ is the minimum number $k$ such that there is an acyclic edge coloring using $k$ colors. The maximum degree in $G$ denoted by $Delta(G)$, is the lower bound for $chi_a '(G)$. $P$-cuts introduced in this paper acts as a powerfu...
متن کاملOn the Edge-Difference and Edge-Sum Chromatic Sum of the Simple Graphs
For a coloring $c$ of a graph $G$, the edge-difference coloring sum and edge-sum coloring sum with respect to the coloring $c$ are respectively $sum_c D(G)=sum |c(a)-c(b)|$ and $sum_s S(G)=sum (c(a)+c(b))$, where the summations are taken over all edges $abin E(G)$. The edge-difference chromatic sum, denoted by $sum D(G)$, and the edge-sum chromatic sum, denoted by $sum S(G)$, a...
متن کاملAcyclic edge coloring of subcubic graphs
An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The acyclic chromatic index of a graph is the minimum number k such that there is an acyclic edge coloring using k colors and is denoted by a(G). From a result of Burnstein it follows that all subcubic graphs are acyclically edge colorable using 5 colors. This result is tight since there are...
متن کاملd-Regular Graphs of Acyclic Chromatic Index
An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The acyclic chromatic index of a graph is the minimum number k such that there is an acyclic edge coloring using k colors and is denoted by a′(G). It was conjectured by Alon, Sudakov and Zaks (and earlier by Fiamcik) that a′(G)≤ +2, where = (G) denotes the maximum degree of the graph. Alon e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Graph Theory
دوره 53 شماره
صفحات -
تاریخ انتشار 2006