\( L ( p , q )\)-labelings of subdivisions of graphs

DOI10.1016/j.dam.2020.12.019zbMath1460.05163OpenAlexW3115963731MaRDI QIDQ2659077

Yanyan Li

Publication date: 25 March 2021

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

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

zbMATH Keywords

subdivision\(L(p,q)\)-labeling\(p,q\)-total labeling

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (1)

Exact square coloring of graphs resulting from some graph operations and products

Cites Work

• Unnamed Item
• Unnamed Item
• \(L(d,1)\)-labelings of the edge-path-replacement of a graph
• \(L(2,1)\)-labelings of subdivisions of graphs
• 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
• \(L(d,1)\)-labelings of the edge-path-replacement by factorization 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
• Total colorings of planar graphs with large maximum degree
• 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

This page was built for publication: \( L ( p , q )\)-labelings of subdivisions of graphs