L(j,k)-labeling number of Cartesian product of path and cycle
From MaRDI portal
Publication:5963640
DOI10.1007/S10878-014-9775-4zbMATH Open1331.05188OpenAlexW2028455309MaRDI QIDQ5963640FDOQ5963640
Qiong Wu, Wai Chee Shiu, Pak Kiu Sun
Publication date: 23 February 2016
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-014-9775-4
Recommendations
Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cites Work
- Title not available (Why is that?)
- A survey on labeling graphs with a condition at distance two
- Circular chromatic number: A survey
- Efficient distributions of arms‐control inspection effort
- Circular Distance Two Labeling and the $\lambda$-Number for Outerplanar Graphs
- Labeling trees with a condition at distance two
- Circular colorings of edge-weighted graphs
- \(L (j, k)\)- and circular \(L(j, k)\)-labellings for the products of complete graphs
- Title not available (Why is that?)
- Hamiltonicity and circular distance two labellings
- Title not available (Why is that?)
- Recent progress in mathematics and engineering on optimal graph labellings with distance conditions
- \(L(j, k)\)-number of direct product of path and cycle
- Circular \(L(j,k)\)-labeling number of direct product of path and cycle
Cited In (4)
This page was built for publication: \(L(j,k)\)-labeling number of Cartesian product of path and cycle
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5963640)