[r,s,t]-colorings of graph products

DOI10.1007/S00373-013-1338-4MaRDI QIDQ742628zbMATH OpenOpenAlexFDO

Authors Lyes Dekar, Brice Effantin, H. Kheddouci

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

zbMATH Keywords

graph coloringdirect productCartesian product

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• \(T\)-coloring of product graphs
• \([r,s,t]\)-colorings of graphs
• \([r, s, t; f]\)-coloring of graphs
• On colouring products of graphs
• scientific article; zbMATH DE number 7746011
• Total colorings of product graphs
• Total coloring of certain classes of product graphs
• \(k\)-tuple colorings of the Cartesian product of graphs
• Total coloring conjecture on certain classes of product graphs
• A note on \([r, s, c, t]\)-colorings of graphs

Cites work

• scientific article; zbMATH DE number 734463 (Why is no real title available?)
• scientific article; zbMATH DE number 5492392 (Why is no real title available?)
• Bent Hamilton cycles in \(d\)-dimensional grid graphs
• Factoring the Cartesian product of a cubic graph and a triangle
• Grundy number of graphs
• Kronecker products of paths and cycles: Decomposition, factorization and bi-pancyclicity
• Long cycles and long paths in the Kronecker product of a cycle and a tree
• On the chromatic number of the lexicographic product and the Cartesian sum of graphs
• Perfect r-domination in the Kronecker product of two cycles, with an application to diagonal/toroidal mesh
• Smallest independent dominating sets in Kronecker products of cycles
• Some bounds for the b-chromatic number of a graph
• Some remarks on the Kronecker product of graphs
• Star chromatic numbers and products of graphs
• The fractional chromatic number of the direct product of graphs
• Total domination number of grid graphs
• \((d,1)\)-total labelling of planar graphs with large girth and high maximum degree
• \([r,s,t]\)-chromatic numbers and hereditary properties of graphs
• \([r,s,t]\)-coloring of trees and bipartite graphs
• \([r,s,t]\)-colorings of graphs
• \([r,s,t]\)-colorings of stars
• \([r,s,t]\)-colourings of paths

Cited in

(6)

• Facial \([r,s,t]\)-colorings of plane graphs
• \(\left [r,s,t\right]\)-colorings of fans.
• \([r, s, t]\)-colouring of paths, cycles and stars
• scientific article; zbMATH DE number 7746011 (Why is no real title available?)
• \([r,s,t]\)-colorings of friendship graphs and wheels
• \([r,s,t]\)-colorings of graphs

This page was built for publication: \([r,s,t]\)-colorings of graph products

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q742628)