\(L(1,1)\)-labelling of the direct product of a complete graph and a cycle
From MaRDI portal
Publication:498455
DOI10.1007/s10878-013-9669-xzbMath1332.90328OpenAlexW1967251085MaRDI QIDQ498455
Byeong Moon Kim, Byung Chul Song, Yoomi Rho
Publication date: 28 September 2015
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-013-9669-x
Programming involving graphs or networks (90C35) Paths and cycles (05C38) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Coloring the square of the Cartesian product of two cycles
- Distance two labelling and direct products of graphs
- Maximum bipartite subgraphs of Kneser graphs
- \(T\)-colorings of graphs: recent results and open problems
- A note on the chromatic number of the square of the Cartesian product of two cycles
- A survey on the distance-colouring of graphs
- \(L (j, k)\)- and circular \(L(j, k)\)-labellings for the products of complete graphs
- A bound on the chromatic number of the square of a planar graph
- A survey on labeling graphs with a condition at distance two
- Labelling Graphs with a Condition at Distance 2
- Labeling Chordal Graphs: Distance Two Condition
- Approximations for -Colorings of Graphs
- Coloring the square of a planar graph
- On the $\lambda$-Number of $Q_n $ and Related Graphs
- Structural Information and Communication Complexity
- Models and approximation algorithms for channel assignment in radio networks
This page was built for publication: \(L(1,1)\)-labelling of the direct product of a complete graph and a cycle