\([r,s,t]\)-colorings of graph products
From MaRDI portal
Publication:742628
DOI10.1007/s00373-013-1338-4zbMath1298.05113OpenAlexW2122105277MaRDI QIDQ742628
Hamamache Kheddouci, Lyes Dekar, Brice Effantin
Publication date: 19 September 2014
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-013-1338-4
Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph operations (line graphs, products, etc.) (05C76)
Related Items (2)
Facial \([r,s,t\)-colorings of plane graphs] ⋮ \([r,s,t\)-colorings of friendship graphs and wheels]
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some remarks on the Kronecker product of graphs
- \([r,s,t\)-colorings of graphs]
- \([r,s,t\)-chromatic numbers and hereditary properties of graphs]
- \([r,s,t\)-coloring of trees and bipartite graphs]
- Perfect \(r\)-domination in the Kronecker product of two cycles, with an application to diagonal/toroidal mesh
- On the chromatic number of the lexicographic product and the Cartesian sum of graphs
- Long cycles and long paths in the Kronecker product of a cycle and a tree
- Kronecker products of paths and cycles: Decomposition, factorization and bi-pancyclicity
- Total domination number of grid graphs
- Some bounds for the \(b\)-chromatic number of a graph
- Bent Hamilton cycles in \(d\)-dimensional grid graphs
- Factoring the Cartesian product of a cubic graph and a triangle
- \((d,1)\)-total labelling of planar graphs with large girth and high maximum degree
- Star chromatic numbers and products of graphs
- The fractional chromatic number of the direct product of graphs
- Grundy number of graphs
- Smallest independent dominating sets in Kronecker products of cycles
This page was built for publication: \([r,s,t]\)-colorings of graph products
