Labeling Planar Graphs without 4,5-Cycles with a Condition on Distance Two

DOI10.1137/10080453XzbMath1245.05111OpenAlexW2079525342MaRDI QIDQ2902887

Haiyang Zhu, Cuiqi Wang, Xin-zhong Lü, Ming Chen

Publication date: 22 August 2012

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

Full work available at URL: https://doi.org/10.1137/10080453x

zbMATH Keywords

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

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (9)

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 ⋮ The \(L(p, q)\)-labelling of planar graphs without 4-cycles ⋮ List‐Coloring the Squares 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

This page was built for publication: Labeling Planar Graphs without 4,5-Cycles with a Condition on Distance Two