A tight upper bound on the (\(2,1\))-total labeling number of outerplanar graphs
From MaRDI portal
Publication:450562
DOI10.1016/j.jda.2011.12.020zbMath1248.05180OpenAlexW1974474803MaRDI QIDQ450562
Toshimasa Ishii, Toru Hasunuma, Hirotaka Ono, Yushi Uno
Publication date: 13 September 2012
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2011.12.020
Related Items (5)
A new sufficient condition for a tree \(T\) to have the \((2,1)\)-total number \(\Delta +1\) ⋮ \((2,1)\)-total labeling of a class of subcubic graphs ⋮ Facial \([r,s,t\)-colorings of plane graphs] ⋮ The \((p,q)\)-total labeling problem for trees ⋮ The (2,1)-Total Labeling Number of Outerplanar Graphs Is at Most Δ + 2
Cites Work
- Unnamed Item
- On \((d,1)\)-total numbers of graphs
- On the chromatic index of outerplanar graphs
- \((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
- SOME UNSOLVED PROBLEMS IN GRAPH THEORY
This page was built for publication: A tight upper bound on the (\(2,1\))-total labeling number of outerplanar graphs
