\((2,1)\)-total labelling of outerplanar graphs

DOI10.1016/J.DAM.2007.07.016zbMath1129.05041OpenAlexW2016768523MaRDI QIDQ2462398

Dong Chen, Wei Fan Wang

Publication date: 30 November 2007

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2007.07.016

zbMATH Keywords

outerplanar graph\((2, 1)\)-total labellingmaximum degreee

Mathematics Subject Classification ID

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

Related Items (17)

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 ⋮ (2,1)-total labelling of planar graphs with large maximum degree ⋮ \( L ( p , q )\)-labelings of subdivisions of graphs ⋮ Facial \([r,s,t\)-colorings of plane graphs] ⋮ The \((p,q)\)-total labeling problem for trees ⋮ \((p,q)\)-total labeling of complete graphs ⋮ A tight upper bound on the (\(2,1\))-total labeling number of outerplanar graphs ⋮ On \((p,1)\)-total labelling of 1-planar graphs ⋮ \(L(2,1)\)-labelings of subdivisions of graphs ⋮ The (2,1)-Total Labeling Number of Outerplanar Graphs Is at Most Δ + 2 ⋮ On \((p,1)\)-total labelling of planar graphs ⋮ (2,1)-total labelling of trees with sparse vertices of maximum degree ⋮ \((2,1)\)-Total number of trees with maximum degree three ⋮ A sufficient condition for a tree to be \((\Delta+1)\)-\((2,1)\)-totally labelable ⋮ On \((d,1)\)-total numbers of graphs ⋮ \((2,1)\)-total labeling of trees with large maximum degree

Cites Work

• Unnamed Item
• \([r,s,t\)-colorings of graphs]
• A bound on the total chromatic number
• The total chromatic number of any multigraph with maximum degree five is at most seven
• List edge and list total colourings of multigraphs
• 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
• A bound on the chromatic number of the square of a planar graph
• The \(L(2,1)\)-labelling of trees
• Labeling Products of Complete Graphs with a Condition at Distance Two
• (d,1)-total labeling of graphs with a given maximum average degree
• Total chromatic number of planar graphs with maximum degree ten
• Labelling Graphs with a Condition at Distance 2
• Labeling Chordal Graphs: Distance Two Condition
• A Theorem about the Channel Assignment Problem
• 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

This page was built for publication: \((2,1)\)-total labelling of outerplanar graphs