Labeling planar graphs with a condition at distance two
From MaRDI portal
Publication:2461777
DOI10.1016/j.ejc.2007.04.019zbMath1127.05089WikidataQ57601513 ScholiaQ57601513MaRDI QIDQ2461777
Peter Bella, Bojan Mohar, Katarína Quittnerová, Daniel Král'
Publication date: 21 November 2007
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01184374/file/dmAE0109.pdf
Related Items (9)
Optimal channel assignment and \(L(p,1)\)-labeling ⋮ The List \(L(2, 1)\)-labeling of planar graphs ⋮ \(k-L(2,1)\)-labelling for planar graphs is NP-complete for \(k\geq 4\) ⋮ Randomly colouring graphs (a combinatorial view) ⋮ Distance constrained labelings of planar graphs with no short cycles ⋮ Graph labellings with variable weights, a survey ⋮ The list \(L(2,1)\)-labeling of planar graphs with large girth ⋮ Distance constrained labelings of \(K_{4}\)-minor free graphs ⋮ Optimal frequency assignment and planar list \(L(2, 1)\)-labeling
Cites Work
- 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
- A bound on the chromatic number of the square of a planar graph
- Labelling Graphs with a Condition at Distance 2
- Labeling Chordal Graphs: Distance Two Condition
- A Theorem about the Channel Assignment Problem
- Coloring Powers of Planar Graphs
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Labeling planar graphs with a condition at distance two
