(d,1)-total labeling of graphs with a given maximum average degree

DOI10.1002/jgt.20124zbMath1084.05061OpenAlexW4235429310MaRDI QIDQ3376692

Mickaël Montassier, Andre Raspaud

Publication date: 24 March 2006

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20124

zbMATH Keywords

total coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (24)

A new sufficient condition for a tree \(T\) to have the \((2,1)\)-total number \(\Delta +1\) ⋮ \((d,1)\)-total labelling of planar graphs with large girth and high maximum degree ⋮ \((2,1)\)-total labeling of a class of subcubic graphs ⋮ (2,1)-total labelling of planar graphs with large maximum degree ⋮ Backbone coloring for triangle-free planar graphs ⋮ \( L ( p , q )\)-labelings of subdivisions of graphs ⋮ On the total choosability of planar graphs and of sparse graphs ⋮ The \((p,q)\)-total labeling problem for trees ⋮ On backbone coloring of graphs ⋮ \((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 ⋮ 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 ⋮ (2,1)-total labelling of trees with sparse vertices of maximum degree ⋮ Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average 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

• Minimum partition of a matroid into independent subsets
• Unnamed Item

This page was built for publication: (d,1)-total labeling of graphs with a given maximum average degree