Labeling planar graphs without 4,5-cycles with a condition on distance two

DOI10.1137/10080453XMaRDI QIDQ2902887zbMATH OpenOpenAlexFDO

Authors Hai-Yang Zhu, Xin-Zhong Lu, Cui-Qi Wang, 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

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

Recommendations

• The L(p, q)-labelling of planar graphs without 4-cycles
• scientific article; zbMATH DE number 6001293
• The \(L(p,q)\)-labeling of planar graphs without cycles of length from 4 to 9
• Labeling of planar graphs with a condition on distance two
• Labelling planar graphs without 4-cycles with a condition on distance two

Cited in

(18)

• The list \(L(2,1)\)-labeling of planar graphs with large girth
• The \(L(p, q)\)-labelling of planar graphs without 4-cycles
• On \(L (p, q)\)-labelling of planar graphs without cycles of length four
• List-coloring the squares of planar graphs without 4-cycles and 5-cycles
• scientific article; zbMATH DE number 5763155 (Why is no real title available?)
• The \(L(p,q)\)-labeling of planar graphs without cycles of length from 4 to 9
• Optimal channel assignment and \(L(p,1)\)-labeling
• Optimal frequency assignment and planar list \(L(2, 1)\)-labeling
• scientific article; zbMATH DE number 6001293 (Why is no real title available?)
• The List \(L(2, 1)\)-labeling of planar graphs
• scientific article; zbMATH DE number 6262928 (Why is no real title available?)
• \(L(p, q)\)-labeling of planar graphs with small girth
• Labeling of planar graphs with a condition on distance two
• Sufficient conditions for planar graphs without 4-cycles and 5-cycles to be 2-degenerate
• Labelling planar graphs without 4-cycles with a condition on distance two
• Labeling Planar Graphs with Conditions on Girth and Distance Two
• Distance constrained labelings of planar graphs with no short cycles
• List 2-distance \(\varDelta +3\)-coloring of planar graphs without 4,5-cycles

This page was built for publication: Labeling planar graphs without 4,5-cycles with a condition on distance two

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2902887)