The \((p,q)\)-total labeling problem for trees
From MaRDI portal
Publication:408175
DOI10.1016/j.disc.2012.01.007zbMath1241.05124OpenAlexW2068793672MaRDI QIDQ408175
Hirotaka Ono, Toru Hasunuma, Toshimasa Ishii, Yushi Uno
Publication date: 29 March 2012
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2012.01.007
Related Items
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 ⋮ Computational complexity of distance edge labeling ⋮ A sufficient condition for a tree to be \((\Delta+1)\)-\((2,1)\)-totally labelable ⋮ \((2,1)\)-total labeling of trees with large maximum degree
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A tight upper bound on the (\(2,1\))-total labeling number of outerplanar graphs
- \([r,s,t\)-colorings of graphs]
- \([r,s,t\)-coloring of trees and bipartite graphs]
- Complexity of (p,1)-total labelling
- \(L(j,k)\)-labelling and maximum ordering-degrees for trees
- \((2,1)\)-Total number of trees with maximum degree three
- On \((d,1)\)-total numbers of graphs
- Labeling trees with a condition at distance two.
- On \(L(d,1)\)-labelings 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
- The (p,q)-total Labeling Problem for Trees
- (d,1)-total labeling of graphs with a given maximum average degree
- Computational Complexity of the Distance Constrained Labeling Problem for Trees (Extended Abstract)
- A Linear Time Algorithm for L(2,1)-Labeling of Trees
- Labelling Graphs with a Condition at Distance 2
- On the $\lambda$-Number of $Q_n $ and Related Graphs
- The $L(2,1)$-Labeling Problem on Graphs
- SOME UNSOLVED PROBLEMS IN GRAPH THEORY
