The \(L(2,1)\)-labelling problem for cubic Cayley graphs on dihedral groups
From MaRDI portal
Publication:1956236
DOI10.1007/s10878-012-9525-4zbMath1273.90227MaRDI QIDQ1956236
Xiangwen Li, Vicky Mak-Hau, Sanming Zhou
Publication date: 13 June 2013
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-012-9525-4
Cayley graph; dihedral group; \(\lambda\)-number; \(L(2,1)\)-labelling; honeycomb torus; brick product; honeycomb toroidal graph
90C35: Programming involving graphs or networks
Related Items
L(3,1)-labeling of circulant graphs, \(L(2,1)\)-labeling for brick product graphs, A note on the minimum number of choosability of planar graphs, List edge and list total coloring of planar graphs with maximum degree 8, Minimum number of disjoint linear forests covering a planar graph, \(L(2, 1)\)-labeling of circulant graphs, On the \(L\)(2,~1)-labeling conjecture for brick product graphs, An efficient case for computing minimum linear arboricity with small maximum degree
Cites Work
- Unnamed Item
- Unnamed Item
- Generalized honeycomb torus is Hamiltonian
- No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups
- Honeycomb toroidal graphs are Cayley graphs
- Generalized honeycomb torus
- Distance-two labellings of Hamming graphs
- Labeling outerplanar graphs with maximum degree three
- On \(L(2,1)\)-labelings of Cartesian products of paths and cycles
- On generalized Petersen graphs labeled with a condition at distance two
- \(L(h,1)\)-labeling subclasses of planar graphs
- A channel assignment problem for optical networks modelled by Cayley graphs
- On a class of Hamiltonian laceable 3-regular graphs
- Further mathematical properties of Cayley digraphs applied to hexagonal and honeycomb meshes
- On the \(L(p,1)\)-labelling of graphs
- A bound on the chromatic number of the square of a planar graph
- Griggs and Yeh's Conjecture and $L(p,1)$-labelings
- Channel assignment on Cayley graphs
- $L(2,1)$-Labeling of Hamiltonian graphs with Maximum Degree 3
- Labelling Graphs with a Condition at Distance 2
- Labeling Chordal Graphs: Distance Two Condition
- A Theorem about the Channel Assignment Problem
- Approximations for -Colorings of Graphs
- The $L(2,1)$-Labeling Problem on Graphs
- Circular Distance Two Labeling and the $\lambda$-Number for Outerplanar Graphs
- Labelling Cayley Graphs on Abelian Groups
- Self-dual configurations and regular graphs
