Distance constrained labelings of planar graphs with no short cycles

DOI10.1016/j.dam.2008.08.013zbMath1211.05143OpenAlexW1975912028WikidataQ57601461 ScholiaQ57601461MaRDI QIDQ967308

Zdeněk Dvořák, Daniel Král', Riste Škrekovski, Pavel Nejedlý

Publication date: 28 April 2010

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

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

zbMATH Keywords

\(L(p,q)\)-labelingdistance constrained labelingplanar graphs with no short cycles

Mathematics Subject Classification ID

Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (7)

The List \(L(2, 1)\)-labeling of planar graphs ⋮ List \(r\)-hued chromatic number of graphs with bounded maximum average degrees ⋮ Sufficient sparseness conditions for \(G^2\) to be \((\Delta + 1)\)-choosable, when \(\Delta \geq 5\) ⋮ The \(L(p, q)\)-labelling of planar graphs without 4-cycles ⋮ \(L(p, q)\)-labeling of planar graphs with small girth ⋮ Injective colorings of planar graphs with few colors ⋮ 2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six and \(\varDelta \geq 18\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Labeling trees with a condition at distance two.
• On \(L(d,1)\)-labelings of graphs
• An exact algorithm for the channel assignment problem
• On the span in channel assignment problems: Bounds, computing and counting
• Coloring squares of planar graphs with girth six
• Labeling planar graphs with a condition at distance two
• 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
• On Moore Graphs with Diameters 2 and 3
• Labelling Graphs with a Condition at Distance 2
• Labeling Chordal Graphs: Distance Two Condition
• A Theorem about the Channel Assignment Problem
• Labeling Planar Graphs with Conditions on Girth and Distance Two
• Coloring the square of a planar graph
• The $L(2,1)$-Labeling Problem on Graphs
• Coloring Powers of Chordal Graphs
• Fixed-parameter complexity of \(\lambda\)-labelings

This page was built for publication: Distance constrained labelings of planar graphs with no short cycles