\((d,1)\)-total labelling of planar graphs with large girth and high maximum degree

DOI10.1016/j.disc.2005.12.059zbMath1120.05076OpenAlexW2021871649MaRDI QIDQ2370454

Fabrice Bazzaro, Mickaël Montassier, Andre Raspaud

Publication date: 26 June 2007

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

Full work available at URL: https://doi.org/10.1016/j.disc.2005.12.059

zbMATH Keywords

labellingtotal coloring

Mathematics Subject Classification ID

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

Related Items (19)

\((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 ⋮ The \((p,q)\)-total labeling problem for trees ⋮ On list \((p, 1)\)-total labellings of special planar graphs and 1-planar 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 ⋮ On \((p, 1)\)-total labelling of some 1-planar graphs ⋮ The (2,1)-Total Labeling Number of Outerplanar Graphs Is at Most Δ + 2 ⋮ \((2,1)\)-total labelling of outerplanar graphs ⋮ On \((p, 1)\)-total labelling of NIC-planar graphs ⋮ On \((p,1)\)-total labelling of planar graphs ⋮ \([r,s,t\)-coloring of trees and bipartite graphs] ⋮ A structure of 1-planar graph and its applications to coloring problems ⋮ (2,1)-total labelling of trees with sparse vertices of maximum degree ⋮ \((2,1)\)-Total number of trees with maximum degree three ⋮ \([r,s,t\)-colorings of graph products] ⋮ On \((d,1)\)-total numbers of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Choosability of the square of planar subcubic graphs with large girth
• Colorings and girth of oriented planar graphs
• List edge and list total colourings of multigraphs
• Total colourings of planar graphs with large girth
• On the total coloring of certain graphs
• (d,1)-total labeling of graphs with a given maximum average degree
• Labelling Graphs with a Condition at Distance 2
• Total colorings of planar graphs with large maximum degree
• Coloring the square of a planar graph
• On the $\lambda$-Number of $Q_n $ and Related Graphs
• On Total Chromatic Number of a Graph

This page was built for publication: \((d,1)\)-total labelling of planar graphs with large girth and high maximum degree