\(L(p, q)\)-labeling of planar graphs with small girth

DOI10.1016/j.dam.2020.04.021zbMath1443.05164OpenAlexW3019675076MaRDI QIDQ777443

Wei Dong

Publication date: 7 July 2020

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

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

zbMATH Keywords

labelinggirthplanar graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (4)

Exact square coloring of graphs resulting from some graph operations and products ⋮ On list \((p, 1)\)-total labellings of special planar graphs and 1-planar graphs ⋮ Coloring squares of planar graphs with maximum degree at most five ⋮ On \(L (p, q)\)-labelling of planar graphs without cycles of length four

Cites Work

• The \(L(p, q)\)-labelling of planar graphs without 4-cycles
• Labelling planar graphs without 4-cycles with a condition on distance two
• Distance constrained labelings of planar graphs with no short cycles
• \(L(p,q)\)-labeling of sparse graphs
• Coloring squares of planar graphs with girth six
• A bound on the chromatic number of the square of a planar graph
• A survey on labeling graphs with a condition at distance two
• Labeling Planar Graphs without 4,5-Cycles with a Condition on Distance Two
• Labelling Graphs with a Condition at Distance 2
• Labeling Planar Graphs with Conditions on Girth and Distance Two
• Coloring the square of a planar graph
• Unnamed Item

This page was built for publication: \(L(p, q)\)-labeling of planar graphs with small girth