Two coloring problems on matrix graphs

DOI10.1142/S1793830916500531zbMath1345.05028arXiv1512.07239MaRDI QIDQ2821120

Zhe Han, Mei Lu

Publication date: 16 September 2016

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1512.07239

zbMATH Keywords

vertex coloringcoding theorycoloring problemGabidulin codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Graph theory (including graph drawing) in computer science (68R10) Bounds on codes (94B65) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Equidistant rank metric codes: construction and properties
• A note on linearized polynomials and the dimension of their kernels
• BCH codes and distance multi- or fractional colorings in hypercubes asymptotically
• Theory of codes with maximum rank distance
• Bilinear forms over a finite field, with applications to coding theory
• Near-optimal conflict-free channel set assignments for an optical cluster-based hypercube network
• A coloring problem on the \(n\)-cube
• New bounds on a hypercube coloring problem.
• Equidistant codes in the Grassmannian
• New results on two hypercube coloring problems
• Generalized Hypercube and Hyperbus Structures for a Computer Network
• Coding for Errors and Erasures in Random Network Coding

This page was built for publication: Two coloring problems on matrix graphs