A tight upper bound on the (2,1)-total labeling number of outerplanar graphs

DOI10.1016/J.JDA.2011.12.020MaRDI QIDQ450562zbMATH OpenOpenAlexFDO

Authors Toru Hasunuma, Toshimasa Ishii, 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

zbMATH Keywords

maximum degreeouterplanar graph\((2,1)\)-total labelingdistance constrained labeling

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• The \((2,1)\)-total labeling number of outerplanar graphs is at most \(\Delta + 2\)
• \((2,1)\)-total labelling of outerplanar graphs
• scientific article; zbMATH DE number 5811532
• scientific article; zbMATH DE number 2058562
• scientific article; zbMATH DE number 5733075
• scientific article; zbMATH DE number 7267227
• L(h,1,1)-labeling of outerplanar graphs
• L(h,1,1)-Labeling of Outerplanar Graphs
• (2,1)-total labelling of planar graphs with large maximum degree
• On \((p,1)\)-total labelling of planar graphs

Cites work

• scientific article; zbMATH DE number 1559126 (Why is no real title available?)
• (d,1)-total labeling of graphs with a given maximum average degree
• A survey on labeling graphs with a condition at 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
• On the chromatic index of outerplanar graphs
• SOME UNSOLVED PROBLEMS IN GRAPH THEORY
• \((2,1)\)-total labelling of outerplanar graphs
• \((d,1)\)-total labelling of planar graphs with large girth and high maximum degree
• \((p,1)\)-total labelling of graphs

Cited in

(10)

• \((2,1)\)-total labelling of outerplanar graphs
• Facial \([r,s,t]\)-colorings of plane graphs
• scientific article; zbMATH DE number 5811532 (Why is no real title available?)
• scientific article; zbMATH DE number 5733075 (Why is no real title available?)
• 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
• The (p,q)-total labeling problem for trees
• On the number of labeled outerplanar \(k\)-cycle blocks
• The \((2,1)\)-total labeling number of outerplanar graphs is at most \(\Delta + 2\)
• Edge coloring by total labelings of outerplanar graphs

This page was built for publication: A tight upper bound on the (\(2,1\))-total labeling number of outerplanar graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q450562)