\((2,1)\)-Total number of trees with maximum degree three
From MaRDI portal
Publication:989489
DOI10.1016/j.ipl.2009.03.027zbMath1209.68386OpenAlexW1995823878MaRDI QIDQ989489
Publication date: 20 August 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2009.03.027
Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10)
Related Items
A new sufficient condition for a tree \(T\) to have the \((2,1)\)-total number \(\Delta +1\) ⋮ (2,1)-total labelling of planar graphs with large maximum degree ⋮ Facial \([r,s,t\)-colorings of plane graphs] ⋮ The \((p,q)\)-total labeling problem for trees ⋮ 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
- \([r,s,t\)-colorings of graphs]
- (2,1)-total labelling of trees with sparse vertices of maximum degree
- On \((d,1)\)-total numbers of 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 bound on the chromatic number of the square of a planar graph
- The \(L(2,1)\)-labelling of trees
- (d,1)-total labeling of graphs with a given maximum average degree
- $L(2,1)$-Labeling of Hamiltonian graphs with Maximum Degree 3
- Labelling Graphs with a Condition at Distance 2
- Labeling Planar Graphs with Conditions on Girth and Distance Two
- On the $\lambda$-Number of $Q_n $ and Related Graphs
- The $L(2,1)$-Labeling Problem on Graphs
