A sufficient condition for a tree to be (+1)-(2,1)-totally labelable

DOI10.1007/S10878-014-9794-1MaRDI QIDQ5963659zbMATH OpenOpenAlexFDO

Authors Zhengke Miao, Qiaojun Shu, Weifan Wang, Dong Chen

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

zbMATH Keywords

treemaximum degree\((2,1)\)-total labeling

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

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

• $L(2,1)$-Labeling of Hamiltonian graphs with Maximum Degree 3
• (2,1)-total labelling of trees with sparse vertices of maximum degree
• (d,1)-total labeling of graphs with a given maximum average degree
• A bound on the chromatic number of the square of a planar graph
• An O\((n^{1.75})\) algorithm for \(L(2,1)\)-labeling of trees
• Classification of regular embeddings of hypercubes of odd dimension
• Labeling Planar Graphs with Conditions on Girth and Distance Two
• Labelling Graphs with a Condition at Distance 2
• On \((d,1)\)-total numbers of graphs
• On the $\lambda$-Number of $Q_n $ and Related Graphs
• The $L(2,1)$-Labeling Problem on Graphs
• The \((p,q)\)-total labeling problem for trees
• The \(L(2,1)\)-labelling of trees
• \((2,1)\)-Total number of trees with maximum degree three
• \((2,1)\)-total labelling of outerplanar graphs
• \((p,1)\)-total labelling of graphs

Cited in

(7)

• \((2,1)\)-total labeling of trees with large maximum degree
• scientific article; zbMATH DE number 1161337 (Why is no real title available?)
• On critical trees labeled with a condition at distance two
• scientific article; zbMATH DE number 1932300 (Why is no real title available?)
• (2,1)-total labelling of trees with sparse vertices of maximum degree
• \((2,1)\)-Total number of trees with maximum degree three
• A new sufficient condition for a tree \(T\) to have the \((2,1)\)-total number \(\Delta +1\)

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)