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

DOI10.1007/S00373-013-1338-4zbMATH Open1298.05113OpenAlexW2122105277MaRDI QIDQ742628FDOQ742628

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

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

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)

Cites Work

• The fractional chromatic number of the direct product of graphs
• Total domination number of grid graphs
• Some remarks on the Kronecker product of graphs
• Star chromatic numbers and products of graphs
• Some bounds for the \(b\)-chromatic number of a graph
• \((d,1)\)-total labelling of planar graphs with large girth and high maximum degree
• \([r,s,t]\)-colourings of paths
• \([r,s,t]\)-colorings of stars
• \([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
• Title not available (Why is that?)
• Perfect \(r\)-domination in the Kronecker product of two cycles, with an application to diagonal/toroidal mesh
• Kronecker products of paths and cycles: Decomposition, factorization and bi-pancyclicity
• Grundy number of graphs
• 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
• Bent Hamilton cycles in \(d\)-dimensional grid graphs
• Factoring the Cartesian product of a cubic graph and a triangle
• Title not available (Why is that?)
• Smallest independent dominating sets in Kronecker products of cycles

Cited In (6)

• Facial \([r,s,t]\)-colorings of plane graphs
• \(\left [r,s,t\right]\)-colorings of fans.
• Title not available (Why is that?)
• \([r, s, t]\)-colouring of paths, cycles and stars
• \([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)