A sufficient condition for a tree to be (+1)-(2,1)-totally labelable
From MaRDI portal
Publication:5963659
DOI10.1007/S10878-014-9794-1zbMATH Open1333.90141OpenAlexW252958960MaRDI QIDQ5963659FDOQ5963659
Dong Chen, Qiaojun Shu, Zhengke Miao, Weifan Wang
Publication date: 23 February 2016
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-014-9794-1
Recommendations
- \((2,1)\)-total labeling of trees with large maximum degree
- A new sufficient condition for a tree \(T\) to have the \((2,1)\)-total number \(\Delta +1\)
- (2,1)-total labelling of trees with sparse vertices of maximum degree
- \((2,1)\)-Total number of trees with maximum degree three
- The \(L(2,1)\)-labelling of trees
Cites Work
- The \(L(2,1)\)-labelling of trees
- Labelling Graphs with a Condition at Distance 2
- A bound on the chromatic number of the square of a planar graph
- Labeling Planar Graphs with Conditions on Girth and Distance Two
- The $L(2,1)$-Labeling Problem on Graphs
- \((2,1)\)-total labelling of outerplanar graphs
- \((p,1)\)-total labelling of graphs
- (d,1)-total labeling of graphs with a given maximum average degree
- The \((p,q)\)-total labeling problem for trees
- On the $\lambda$-Number of $Q_n $ and Related Graphs
- Classification of regular embeddings of hypercubes of odd dimension
- On \((d,1)\)-total numbers of graphs
- \((2,1)\)-Total number of trees with maximum degree three
- An O\((n^{1.75})\) algorithm for \(L(2,1)\)-labeling of trees
- $L(2,1)$-Labeling of Hamiltonian graphs with Maximum Degree 3
- (2,1)-total labelling of trees with sparse vertices of maximum degree
Cited In (4)
This page was built for publication: A sufficient condition for a tree to be \((\Delta+1)\)-\((2,1)\)-totally labelable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5963659)
