The \(L(p, q)\)-labelling of planar graphs without 4-cycles

DOI10.1016/j.dam.2013.08.039zbMath1297.05211OpenAlexW2015437014MaRDI QIDQ741764

Wei Chen, Haiyang Zhu, Li-Feng Hou, Xin-zhong Lü

Publication date: 12 September 2014

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

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

zbMATH Keywords

cyclesplanar graphs\(L(p,q)\)-labellingWegner's conjecture

Mathematics Subject Classification ID

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

Related Items (8)

Optimal channel assignment and \(L(p,1)\)-labeling ⋮ List 2-distance \(\varDelta +3\)-coloring of planar graphs without 4,5-cycles ⋮ The List \(L(2, 1)\)-labeling of planar graphs ⋮ On \(L (p, q)\)-labelling of planar graphs without cycles of length four ⋮ The list \(L(2,1)\)-labeling of planar graphs with large girth ⋮ 2-Distance Coloring of Planar Graphs without 4-Cycles and 5-Cycles ⋮ \(L(p, q)\)-labeling of planar graphs with small girth ⋮ Optimal frequency assignment and planar list \(L(2, 1)\)-labeling

Cites Work

• Unnamed Item
• Unnamed Item
• Labelling planar graphs without 4-cycles with a condition on distance two
• Distance constrained labelings of planar graphs with no short cycles
• Graph labellings with variable weights, a survey
• Choosability of the square of planar subcubic graphs with large girth
• 2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six and \(\varDelta \geq 18\)
• List \((p,q)\)-coloring of sparse plane graphs
• Sufficient conditions for the minimum 2-distance colorability of plane graphs of girth 6
• Coloring squares of planar graphs with girth six
• A survey on the distance-colouring of graphs
• On the \(L(p,1)\)-labelling of graphs
• A bound on the chromatic number of the square of a planar graph
• Sufficient conditions for planar graphs to be 2-distance (\(\Delta+1\))-colourable
• Labeling Planar Graphs without 4,5-Cycles with a Condition on Distance Two
• Griggs and Yeh's Conjecture and $L(p,1)$-labelings
• List Colouring Squares of Planar Graphs
• On the total coloring of planar graphs.
• Labelling Graphs with a Condition at Distance 2
• A Theorem about the Channel Assignment Problem
• Labeling Planar Graphs with Conditions on Girth and Distance Two
• Coloring the square of a planar graph

This page was built for publication: The \(L(p, q)\)-labelling of planar graphs without 4-cycles