Linear \(k\)-arboricity of Caylay graphs on abelian groups with given degree
From MaRDI portal
Publication:2071534
DOI10.1007/s11786-021-00503-6MaRDI QIDQ2071534
Nan Jia, Zhao Wang, Yaping Mao, Eddie Cheng
Publication date: 28 January 2022
Published in: Mathematics in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11786-021-00503-6
05C15: Coloring of graphs and hypergraphs
05C78: Graph labelling (graceful graphs, bandwidth, etc.)
05C76: Graph operations (line graphs, products, etc.)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On linear k-arboricity
- The linear 3-arboricity of \(K_{n,n}\) and \(K_n\)
- The linear arboricity of graphs
- Algorithmic aspects of linear \(k\)-arboricity
- Two-coloring the edges of a cubic graph such that each monochromatic component is a path of length at most 5
- Reliable broadcasting in product networks
- Linear \(k\)-arboricities on trees
- On the linear \(k\)-arboricity of \(K_n\) and \(K_{n,n}\)
- Trees, paths, stars, caterpillars and spiders
- Hamiltonian decompositions of Cayley graphs on abelian groups of odd order
- Path-connectivity of lexicographic product graphs
- A Planar linear arboricity conjecture
- A Class of Arc-Transitive Cayley Graphs as Models for Interconnection Networks
- A group-theoretic model for symmetric interconnection networks
- Algebraic Graph Theory
- COVERING AND PACKING IN GRAPHS, I.
- Linear arboricity and linear \(k\)-arboricity of regular graphs
