Labeling planar graphs without 4,5-cycles with a condition on distance two
DOI10.1137/10080453XzbMATH Open1245.05111OpenAlexW2079525342MaRDI QIDQ2902887FDOQ2902887
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
Recommendations
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)
Cited In (18)
- Labeling Planar Graphs with Conditions on Girth and Distance Two
- Optimal channel assignment and \(L(p,1)\)-labeling
- Sufficient conditions for planar graphs without 4-cycles and 5-cycles to be 2-degenerate
- Labeling of planar graphs with a condition on distance two
- List-coloring the squares of planar graphs without 4-cycles and 5-cycles
- Title not available (Why is that?)
- Title not available (Why is that?)
- The \(L(p, q)\)-labelling of planar graphs without 4-cycles
- \(L(p, q)\)-labeling of planar graphs with small girth
- The list \(L(2,1)\)-labeling of planar graphs with large girth
- The List \(L(2, 1)\)-labeling of planar graphs
- Labelling planar graphs without 4-cycles with a condition on 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
- Optimal frequency assignment and planar list \(L(2, 1)\)-labeling
- On \(L (p, q)\)-labelling of planar graphs without cycles of length four
- Title not available (Why is that?)
- The \(L(p,q)\)-labeling of planar graphs without cycles of length from 4 to 9
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)
