Coloring the square of the Cartesian product of two cycles

DOI10.1016/J.DISC.2010.05.011zbMATH Open1213.05101OpenAlexW2080714490MaRDI QIDQ708380FDOQ708380

Authors: Jiaojiao Wu, Éric Sopena 

Publication date: 11 October 2010

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2010.05.011

Recommendations

• A note on the chromatic number of the square of the Cartesian product of two cycles
• The square chromatic number of the torus
• scientific article; zbMATH DE number 5942282
• Coloring the square of the semi-strong product of cycles and paths
• On the dynamic coloring of Cartesian product graphs

zbMATH Keywords

chromatic numbercycleCartesian productsquare of graphsdistance 2-colouring

Mathematics Subject Classification ID

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

Cites Work

• On \(L(d,1)\)-labeling of Cartesian product of a cycle and a path
• On \(L(2,1)\)-labelings of Cartesian products of paths and cycles
• Labelling Graphs with a Condition at Distance 2
• Coloring squares of planar graphs with girth six
• A bound on the chromatic number of the square of a planar graph
• Coloring the square of a planar graph
• On the $\lambda$-Number of $Q_n $ and Related Graphs
• Labeling products of complete graphs with a condition at distance two
• \(L(2,1)\)-labelings of Cartesian products of two cycles
• Optimal \(L(d,1)\)-labelings of certain direct products of cycles and Cartesian products of cycles
• Optimal \(L(2,1)\)-labeling of Cartesian products of cycles, with an application to independent domination
• Title not available (Why is that?)
• List Colouring Squares of Planar Graphs
• Coloring the square of an outerplanar graph
• Colourings of the Cartesian Product of Graphs and Multiplicative Sidon Sets

Cited In (16)

• A note on the chromatic number of the square of the Cartesian product of two cycles
• Title not available (Why is that?)
• The \(k\)-distance independence number and 2-distance chromatic number of Cartesian products of cycles
• 2-distance colorings of some direct products of paths and cycles
• The 2-distance coloring of the Cartesian product of cycles using optimal Lee codes
• Title not available (Why is that?)
• 2-distance chromatic number of some graph products
• Oriented chromatic number of Cartesian products \(P_m \square P_n\) and \(C_m \square P_n \)
• The square chromatic number of the torus
• On the dynamic coloring of Cartesian product graphs
• Title not available (Why is that?)
• Exact square coloring of graphs resulting from some graph operations and products
• \(L(1,1)\)-labelling of the direct product of a complete graph and a cycle
• A two-coloring of Cartesian products
• Coloring the square of the semi-strong product of cycles and paths
• Coloring the square of Sierpiński graphs

This page was built for publication: Coloring the square of the Cartesian product of two cycles

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