Coloring the square of the Cartesian product of two cycles
From MaRDI portal
Publication:708380
Recommendations
Cites work
- scientific article; zbMATH DE number 1792593 (Why is no real title available?)
- A bound on the chromatic number of the square of a planar graph
- Coloring squares of planar graphs with girth six
- Coloring the square of a planar graph
- Coloring the square of an outerplanar graph
- Colourings of the Cartesian Product of Graphs and Multiplicative Sidon Sets
- Labeling products of complete graphs with a condition at distance two
- Labelling Graphs with a Condition at Distance 2
- List Colouring Squares of Planar Graphs
- On \(L(2,1)\)-labelings of Cartesian products of paths and cycles
- On \(L(d,1)\)-labeling of Cartesian product of a cycle and a path
- On the $\lambda$-Number of $Q_n $ and Related Graphs
- Optimal \(L(2,1)\)-labeling of Cartesian products of cycles, with an application to independent domination
- Optimal \(L(d,1)\)-labelings of certain direct products of cycles and Cartesian products of cycles
- \(L(2,1)\)-labelings of Cartesian products of two cycles
Cited in
(16)- A two-coloring of Cartesian products
- scientific article; zbMATH DE number 7594570 (Why is no real title available?)
- A note on the chromatic number of the square of the Cartesian product of two cycles
- Oriented chromatic number of Cartesian products \(P_m \square P_n\) and \(C_m \square P_n \)
- scientific article; zbMATH DE number 55890 (Why is no real title available?)
- The square chromatic number of the torus
- scientific article; zbMATH DE number 5942282 (Why is no real title available?)
- 2-distance chromatic number of some graph products
- The \(k\)-distance independence number and 2-distance chromatic number of Cartesian products of cycles
- On the dynamic coloring of Cartesian product graphs
- \(L(1,1)\)-labelling of the direct product of a complete graph and a cycle
- Exact square coloring of graphs resulting from some graph operations and products
- 2-distance colorings of some direct products of paths and cycles
- Coloring the square of Sierpiński graphs
- Coloring the square of the semi-strong product of cycles and paths
- The 2-distance coloring of the Cartesian product of cycles using optimal Lee codes
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)