L(2,1)-labelings of Cartesian products of two cycles
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1792593
- Optimal L(2,1)-labeling of Cartesian products of cycles, with an application to independent domination
- On L(d,1)-labelings of the Cartesian product of two cycles.
- \(L(2,1)\)-labeling of direct product of paths and cycles
- On L(2,1)-labelings of Cartesian products of paths and cycles
Cites work
- A note on distance-\(k\) labeling and \(k\)th powers of graphs
- Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers
- Hamiltonicity and circular distance two labellings
- scientific article; zbMATH DE number 1185300 (Why is no real title available?)
- scientific article; zbMATH DE number 1743760 (Why is no real title available?)
- scientific article; zbMATH DE number 1792593 (Why is no real title available?)
- scientific article; zbMATH DE number 841588 (Why is no real title available?)
- scientific article; zbMATH DE number 881282 (Why is no real title available?)
- scientific article; zbMATH DE number 1409224 (Why is no real title available?)
- scientific article; zbMATH DE number 1439442 (Why is no real title available?)
- Labeling Chordal Graphs: Distance Two Condition
- Labeling products of complete graphs with a condition at distance two
- Labelling Graphs with a Condition at Distance 2
- No-hole \(L(2,1)\)-colorings
- On \(L(d,1)\)-labelings of graphs
- On critical trees labeled with a condition at distance two
- On generalized Petersen graphs labeled with a condition at distance two
- 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
- Relating path coverings to vertex labellings with a condition at distance two
- The $L(2,1)$-Labeling Problem on Graphs
Cited in
(42)- On \(L(d,1)\)-labeling of Cartesian product of a cycle and a path
- Distance-two labellings of Hamming graphs
- \(L(2,1)\)-labeling of direct product of paths and cycles
- On L(2,1)-labelings of Cartesian products of paths and cycles
- Drawings of \(C_m\times C_n\) with one disjoint family. II
- On the \(L(2,1)\)-labelings of amalgamations of graphs
- Lambda number for the direct product of some family of graphs
- Complexity and algorithms for neighbor-sum-2-distinguishing \(\{1,3\}\)-edge-weighting of graphs
- On \(L(2,1)\)-labelings of some products of oriented cycles
- 2-distance colorings of some direct products of paths and cycles
- The minimum span of \(L(2,1)\)-labelings of certain generalized Petersen graphs
- \(L(2, 1)\)-labelings of the edge-path-replacement of a graph
- \(L(2,1)\)-colorings and irreducible no-hole colorings of Cartesian product of graphs
- List backbone colouring of graphs
- 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
- \(L(h, k)\)-labelling for octagonal grid
- On L(d,1)-labelings of the Cartesian product of two cycles.
- On some results for the L(2,1)-labeling on Cartesian sum graphs.
- L(2, 1)-labellings for direct products of a triangle and a cycle
- Bounds on L (2, 1)-choice number of Cartesian products of paths and spiders
- Backbone coloring for graphs with large girths
- L(d,1)-labelings of the edge-path-replacement of a graph
- Optimal L(2, 1)-labeling of strong products of cycles [transmitter frequency assignment]
- scientific article; zbMATH DE number 1792593 (Why is no real title available?)
- The minimum span of \(L(2,1)\)-labelings of generalized flowers
- On irreducible no-hole L(2, 1)-coloring of Cartesian product of trees with paths
- THE λ-NUMBER OF THE CARTESIAN PRODUCT OF A COMPLETE GRAPH AND A CYCLE
- More relations between -labeling and Hamiltonian paths with emphasis on line graph of bipartite multigraphs
- The \(L(3,2,1)\)-labeling number of the Cartesian product of a complete graph and a cycle.
- L(2,1)-labeling of Kneser graphs and coloring squares of Kneser graphs
- \(l(3,2,1)\)-labeling for the product of a complete graph and a cycle
- Distance two labeling on the square of a cycle
- The (2,1)-total labelling of the product of two kinds of graphs
- L(2,1)-labelings of the edge-multiplicity-paths-replacement of a graph
- L(2,1)-labeling for brick product graphs
- n-fold L(2, 1)-labelings of Cartesian product of paths and cycles
- Coloring the square of the Cartesian product of two cycles
- Labeling amalgamations of Cartesian products of complete graphs with a condition at distance two
- (2,1)-total labelling of trees with sparse vertices of maximum degree
- \(L(2,1)\)-labelings on the composition of \(n\) graphs
- Connectivity of Cartesian products of graphs
This page was built for publication: \(L(2,1)\)-labelings of Cartesian products of two cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2492228)
