Coloring the square of the Cartesian product of two cycles
From MaRDI portal
Publication:708380
DOI10.1016/j.disc.2010.05.011zbMath1213.05101OpenAlexW2080714490MaRDI QIDQ708380
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
Related Items (9)
The square chromatic number of the torus ⋮ Unnamed Item ⋮ Coloring the square of Sierpiński graphs ⋮ \(L(1,1)\)-labelling of the direct product of a complete graph and a cycle ⋮ The \(k\)-distance independence number and 2-distance chromatic number of Cartesian products of cycles ⋮ L(1,1)-Labeling of direct product of cycles ⋮ The 2-distance coloring of the Cartesian product of cycles using optimal Lee codes ⋮ 2-Distance chromatic number of some graph products ⋮ 2-distance colorings of some direct products of paths and cycles
Cites Work
- Unnamed Item
- 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
- Coloring squares of planar graphs with girth six
- Coloring the square of an outerplanar graph
- A bound on the chromatic number of the square of a planar graph
- \(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
- Labeling Products of Complete Graphs with a Condition at Distance Two
- Optimal L(2,1)-labeling of Cartesian products of cycles, with an application to independent domination
- Colourings of the Cartesian Product of Graphs and Multiplicative Sidon Sets
- List Colouring Squares of Planar Graphs
- Labelling Graphs with a Condition at Distance 2
- Coloring the square of a planar graph
- On the $\lambda$-Number of $Q_n $ and Related Graphs
This page was built for publication: Coloring the square of the Cartesian product of two cycles
