On acyclic edge-coloring of the complete bipartite graphs \(K_{2p-1, 2p-1}\) for odd prime \(p\)
type: Item
instance of: scholarly article
title: On acyclic edge-coloring of the complete bipartite graphs \(K_{2p-1, 2p-1}\) for odd prime \(p\)
zbMATH Open document ID: 1322.05063
author: Ayineedi Venkateswarlu
author: Santanu Sarkar
published in: Discrete Mathematics
publication date: 2015-10-08T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 6492132
zbMATH Keywords: acyclic edge-coloring
zbMATH Keywords: acyclic chromatic index
zbMATH Keywords: perfect matching
zbMATH Keywords: perfect 1-factorization
zbMATH Keywords: complete bipartite graphs
MaRDI profile type: Publication
full work available at URL: j.disc.2015.07.010
OpenAlex ID: W1456357822
cites work: Acyclic edge colorings of graphs
cites work: A note on acyclic edge coloring of complete bipartite graphs
cites work: d‐Regular graphs of acyclic chromatic index at least d+2
cites work: A family of perfect factorisations of complete bipartite graphs
cites work: Q4180377
cites work: Q4168628
cites work: Acyclic colorings of planar graphs
cites work: Q4018734
cites work: On perfect one-factorization of the complete graph \(K_{2p}\)
cites work: Q4745851
cites work: Optimal Acyclic Edge Colouring of Grid Like Graphs
cites work: Acyclic Edge Colouring of Outerplanar Graphs
cites work: Improved bounds on coloring of graphs
cites work: The acyclic edge chromatic number of a random d‐regular graph is d + 1
DOI: 10.1016/J.DISC.2015.07.010
description: scientific article; zbMATH DE number 6492132