A note on acyclic edge coloring of complete bipartite graphs (Q1044002): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 03:01, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A note on acyclic edge coloring of complete bipartite graphs |
scientific article |
Statements
A note on acyclic edge coloring of complete bipartite graphs (English)
0 references
10 December 2009
0 references
An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic (\(2\)-coloured) 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^\prime(G)\). It is proved that \(a^\prime(K_{p,p})=p+2=\Delta+2\) when p is an odd prime. Moreover, after removing any edge from \(K_{p,p}\), the resulting graph is acyclically \(\Delta+1=p+1\)-edge-colourable.
0 references
acyclic edge colouring
0 references
acyclic edge chromatic index
0 references
matching
0 references
complete bipartite graph
0 references