\(L(p,q)\)-labeling and integer tension of a graph embedded on torus
From MaRDI portal
Publication:5963610
DOI10.1007/s10878-014-9714-4zbMath1331.05076OpenAlexW2077700835MaRDI QIDQ5963610
Xiao-Ling Zhang, Jian Guo Qian
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-9714-4
Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Cycle bases in graphs characterization, algorithms, complexity, and applications
- The \(L(2,1)\)-labeling on planar graphs
- \(L(h,k)\)-labelings of Hamming graphs
- \(L(2,1)\)-labeling of strong products of cycles
- On \(L(d,1)\)-labelings of graphs
- Distance-two labelings of graphs
- \(L(h,1)\)-labeling subclasses of planar graphs
- Generating cycle spaces for graphs on surfaces with small genera
- On \(L(2,1)\)-labeling of generalized Petersen graphs
- Distance two edge labelings of lattices
- \(L(p,q)\) labeling of \(d\)-dimensional grids
- Circular \(L(j,k)\)-labeling number of direct product of path and cycle
- Recent progress in mathematics and engineering on optimal graph labellings with distance conditions
- The \(L(2,1)\)-labelling of trees
- Radiocoloring in planar graphs: Complexity and approximations
- Tension polynomials of graphs
- Real Number Graph Labellings with Distance Conditions
- Circular chromatic index of Cartesian products of graphs
- Labelling Graphs with a Condition at Distance 2
- The $L(2,1)$-Labeling Problem on Graphs
- A Contribution to the Theory of Chromatic Polynomials
- The edge span of distance two labellings of graphs
This page was built for publication: \(L(p,q)\)-labeling and integer tension of a graph embedded on torus
