Pages that link to "Item:Q967308"
From MaRDI portal
The following pages link to Distance constrained labelings of planar graphs with no short cycles (Q967308):
Displayed 8 items.
- Sufficient sparseness conditions for \(G^2\) to be \((\Delta + 1)\)-choosable, when \(\Delta \geq 5\) (Q741736) (← links)
- The \(L(p, q)\)-labelling of planar graphs without 4-cycles (Q741764) (← links)
- \(L(p, q)\)-labeling of planar graphs with small girth (Q777443) (← links)
- Injective colorings of planar graphs with few colors (Q1045050) (← links)
- 2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six and \(\varDelta \geq 18\) (Q1045187) (← links)
- The List \(L(2, 1)\)-labeling of planar graphs (Q1637136) (← links)
- List \(r\)-hued chromatic number of graphs with bounded maximum average degrees (Q1709519) (← links)
- 2-Distance Coloring of Sparse Graphs (Q2930038) (← links)