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

DOI10.1002/JGT.20124zbMATH Open1084.05061OpenAlexW4235429310MaRDI QIDQ3376692FDOQ3376692

Authors: Mickaël Montassier, André 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

Recommendations

• The (2,1)-total labeling of graphs with low maximum average degree
• On \((d,1)\)-total numbers of graphs
• \((d,1)\)-total labelling of planar graphs with large girth and high maximum degree
• The \((d,1)\)-total labelling of two kinds of graphs
• The maximum degree and \((p,1)\)-total labeling of graphs

zbMATH Keywords

total coloring

Mathematics Subject Classification ID

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

Cites Work

• Minimum partition of a matroid into independent subsets
• Title not available (Why is that?)

Cited In (30)

• List \((d,1)\)-total labelling of graphs embedded in surfaces
• On \((d,1)\)-total numbers of graphs
• \( L ( p , q )\)-labelings of subdivisions of graphs
• On the total choosability of planar graphs and of sparse graphs
• The \((d,1)\)-total labelling of two kinds of 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 \((p, 1)\)-total labelling of NIC-planar graphs
• (2,1)-total labelling of planar graphs with large maximum degree
• A new sufficient condition for a tree \(T\) to have the \((2,1)\)-total number \(\Delta +1\)
• Backbone coloring for triangle-free planar graphs
• On \((p,1)\)-total labelling of planar graphs
• Distance edge coloring by total labelings of graphs
• \((2,1)\)-total labeling of a class of subcubic graphs
• The \((p,q)\)-total labeling problem for trees
• A tight upper bound on the (\(2,1\))-total labeling number of outerplanar graphs
• \((2,1)\)-total labeling of trees with large maximum degree
• \(L(2,1)\)-labelings of subdivisions of graphs
• On \((p, 1)\)-total labelling of some 1-planar graphs
• Title not available (Why is that?)
• The (2,1)-total labeling of graphs with low maximum average degree
• The \((2,1)\)-total labeling number of outerplanar graphs is at most \(\Delta + 2\)
• On \((p,1)\)-total labelling of 1-planar graphs
• \((p,q)\)-total labeling of complete graphs
• The \((d,1)\)-total labelling of the cube of cycles
• Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree
• On backbone coloring of graphs
• \((d,1)\)-total labelling of planar graphs with large girth and high maximum degree
• \((2,1)\)-total labelling of outerplanar graphs

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

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