\(L(2,1)\)-labelings of subdivisions of graphs

DOI10.1016/j.disc.2014.09.006zbMath1303.05171MaRDI QIDQ472974

J. Herrera, Sumit K. Garg

Publication date: 20 November 2014

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

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

zbMATH Keywords

subdivision; \(L(2,1)\)-labeling; total labeling

Mathematics Subject Classification ID

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

Related Items

Irreducible no-hole \(L(2, 1)\)-coloring of edge-multiplicity-paths-replacement graph, On irreducible no-hole \(L(2,1)\)-coloring of subdivision of graphs, \( L ( p , q )\)-labelings of subdivisions of graphs

Cites Work

• \(L(d,1)\)-labelings of the edge-path-replacement of a graph
• On \((d,1)\)-total numbers of graphs
• List edge and list total colourings of multigraphs
• Total colourings of planar graphs with large girth
• Total colourings of graphs
• \((d,1)\)-total labelling of planar graphs with large girth and high maximum degree
• \(L(2, 1)\)-labelings of the edge-path-replacement of a graph
• \((2,1)\)-total labelling of outerplanar graphs
• \((p,1)\)-total labelling of graphs
• A survey on labeling graphs with a condition at distance two
• 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
• On the $\lambda$-Number of $Q_n $ and Related Graphs
• The $L(2,1)$-Labeling Problem on Graphs
• On Total Chromatic Number of a Graph
• Unnamed Item
• Unnamed Item
• Unnamed Item