Bounds for the dichromatic number of a generalized lexicographic product of digraphs
From MaRDI portal
Publication:3178167
DOI10.1142/S1793830916500348zbMath1339.05146OpenAlexW2309395057MaRDI QIDQ3178167
Sayan Panma, Nopparat Pleanmani
Publication date: 8 July 2016
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793830916500348
Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20) Graph operations (line graphs, products, etc.) (05C76)
Related Items
Optimal channel assignment and \(L(p,1)\)-labeling, Acyclic coloring of products of digraphs, Minimum 2-distance coloring of planar graphs and channel assignment
Cites Work