\((2,1)\)-total labeling of a class of subcubic graphs
From MaRDI portal
Publication:324977
DOI10.1016/j.endm.2015.05.039zbMath1347.05222OpenAlexW778216901MaRDI QIDQ324977
Publication date: 17 October 2016
Full work available at URL: https://doi.org/10.1016/j.endm.2015.05.039
Related Items (1)
Facial \([r,s,t\)-colorings of plane graphs]
Cites Work
- The \((p,q)\)-total labeling problem for trees
- (2,1)-total number of joins of paths and cycles
- A tight upper bound on the (\(2,1\))-total labeling number of outerplanar graphs
- Complexity of (p,1)-total labelling
- \((d,1)\)-total labelling of planar graphs with large girth and high maximum degree
- \((2,1)\)-total labelling of outerplanar graphs
- \((p,1)\)-total labelling of graphs
- A survey on labeling graphs with a condition at distance two
- (d,1)-total labeling of graphs with a given maximum average degree
- Labelling Graphs with a Condition at Distance 2
- On the $\lambda$-Number of $Q_n $ and Related Graphs
This page was built for publication: \((2,1)\)-total labeling of a class of subcubic graphs
