On the [r, s, t]-coloring of the square of cylindrical grids

DOI10.47443/DML.2024.148MaRDI QIDQ6994436zbMATH OpenFDO

Authors Brice Effantin

Publication date 23 April 2025

Published in DML. Discrete Mathematics Letters (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.47443/DML.2024.148

zbMATH Keywords

Cartesian productedge coloringtotal coloringvertex coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph operations (line graphs, products, etc.) (05C76)

Cites work

• \([r, s, t]\)-colouring of paths, cycles and stars
• \([r,s,t]\)-coloring of trees and bipartite graphs
• \([r,s,t]\)-colorings of graph products
• \([r,s,t]\)-colorings of graphs
• \([r,s,t]\)-colorings of stars
• \([r,s,t]\)-colourings of paths
• \(L(2,1)\)-colorings and irreducible no-hole colorings of Cartesian product of graphs
• A bound on the chromatic number of the square of a planar graph
• A note on the chromatic number of the square of the Cartesian product of two cycles
• Coloring squares of planar graphs with girth six
• Coloring the square of a planar graph
• Coloring the square of Sierpiński graphs
• Coloring the square of the Cartesian product of two cycles
• Distinguishing chromatic numbers of complements of Cartesian products of complete graphs
• On \(L(d,1)\)-labeling of Cartesian product of a cycle and a path
• On the security number of the Cartesian product of graphs
• Power domination of the Cartesian product of graphs
• The square of a planar cubic graph is 7-colorable

This page was built for publication: On the \([r, s, t]\)-coloring of the square of cylindrical grids

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