作者: Ayineedi Venkateswarlu , Santanu Sarkar
DOI: 10.1016/J.DISC.2015.07.010
关键词: Graph 、 Edge coloring 、 Vertex (geometry) 、 Bipartite graph 、 Discrete mathematics 、 Combinatorics 、 Mathematics 、 Complete bipartite graph
摘要: An acyclic edge-coloring of a graph is proper without bichromatic (2-colored) cycles. The chromatic index G , denoted by ' ( ) the least integer k such that admits an using colors. Let Δ = denote maximum degree vertex in . A complete bipartite with n vertices on each side K Basavaraju, Chandran and Kummini proved ? + 2 when odd. Basavaraju showed p which implies odd prime, main tool their proof perfect 1-factorization In this paper we study case - 1 also possess 1-factorization, where prime. We show colors so get