Labelling planar graphs without 4-cycles with a condition on distance two
From MaRDI portal
Publication:947103
DOI10.1016/j.dam.2007.05.061zbMath1144.05059OpenAlexW2045481795MaRDI QIDQ947103
Publication date: 29 September 2008
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2007.05.061
Related Items
Coloring the square of maximal Planar graphs with diameter two ⋮ Bounding the chromatic number of squares of \(K_4\)-minor-free 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 ⋮ 2-Distance Coloring 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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Edge-partitions of graphs of nonnegative characteristic and their game coloring numbers
- The 4-choosability of plane graphs without 4-cycles
- Coloring the square of a \(K_{4}\)-minor free graph
- On \(L(d,1)\)-labelings of graphs
- \(L(h,1)\)-labeling subclasses of planar graphs
- Coloring the square of an outerplanar graph
- A bound on the chromatic number of the square of a planar graph
- The \(L(2,1)\)-labelling of trees
- Labeling Products of Complete Graphs with a Condition at Distance Two
- Labelling Graphs with a Condition at Distance 2
- Every planar map is four colorable
- 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
- Edge-partitions of planar graphs and their game coloring numbers
- On the $\lambda$-Number of $Q_n $ and Related Graphs
- The $L(2,1)$-Labeling Problem on Graphs
