Pages that link to "Item:Q4797924"
From MaRDI portal
The following pages link to Coloring the square of a planar graph (Q4797924):
Displayed 50 items.
- An improved bound on 2-distance coloring plane graphs with girth 5 (Q306114) (← links)
- Light and low 5-stars in normal plane maps with minimum degree 5 (Q311243) (← links)
- 2-distance coloring of a planar graph without 3, 4, 7-cycles (Q328716) (← links)
- Describing \((d-2)\)-stars at \(d\)-vertices, \(d\leq 5\), in normal plane maps (Q383686) (← links)
- Describing 4-stars at 5-vertices in normal plane maps with minimum degree 5 (Q383687) (← links)
- Locally injective \(k\)-colourings of planar graphs (Q400498) (← links)
- \(L(p,q)\)-labeling of a graph embeddable on the torus (Q400502) (← links)
- Distributed colorings for collision-free routing in sink-centric sensor networks (Q450566) (← links)
- Randomly colouring graphs (a combinatorial view) (Q458462) (← links)
- Coloring the square of Sierpiński graphs (Q497382) (← links)
- \(L(1,1)\)-labelling of the direct product of a complete graph and a cycle (Q498455) (← links)
- An introduction to the discharging method via graph coloring (Q507506) (← links)
- On 2-distance coloring of plane graphs with girth 5 (Q516880) (← links)
- Low minor 5-stars in 3-polytopes with minimum degree 5 and no 6-vertices (Q526251) (← links)
- New upper bounds on the \(L(2,1)\)-labeling of the skew and converse skew product graphs (Q533885) (← links)
- The \(\Delta ^{2}\)-conjecture for \(L(2,1)\)-labelings is true for total graphs (Q548395) (← links)
- Injective colorings of graphs with low average degree (Q548659) (← links)
- \(k-L(2,1)\)-labelling for planar graphs is NP-complete for \(k\geq 4\) (Q602756) (← links)
- Upper bounds on the linear chromatic number of a graph (Q626759) (← links)
- Coloring the square of the Cartesian product of two cycles (Q708380) (← links)
- Minimum 2-distance coloring of planar graphs and channel assignment (Q724734) (← links)
- 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)
- \(L(p,q)\)-labelling of \(K_{4}\)-minor free graphs (Q844189) (← links)
- The \(L(2,1)\)-labeling on planar graphs (Q868019) (← links)
- Low stars in normal plane maps with minimum degree 4 and no adjacent 4-vertices (Q898158) (← links)
- Linear choosability of graphs (Q932648) (← links)
- Labelling planar graphs without 4-cycles with a condition on distance two (Q947103) (← links)
- The distant-2 chromatic number of random proximity and random geometric graphs (Q963353) (← links)
- Distance constrained labelings of planar graphs with no short cycles (Q967308) (← links)
- Some results on distance two labelling of outerplanar graphs (Q1036889) (← links)
- Acyclic edge colorings of planar graphs and series parallel graphs (Q1042911) (← links)
- \(\lambda \)-backbone colorings along pairwise disjoint stars and matchings (Q1045046) (← links)
- Distance constrained labelings of \(K_{4}\)-minor free graphs (Q1045067) (← links)
- Coloring the square of a \(K_{4}\)-minor free graph (Q1402088) (← links)
- Optimal channel assignment and \(L(p,1)\)-labeling (Q1630278) (← links)
- List 2-distance \(\varDelta +3\)-coloring of planar graphs without 4,5-cycles (Q1631690) (← links)
- The List \(L(2, 1)\)-labeling of planar graphs (Q1637136) (← links)
- Facial \(L(2, 1)\)-edge-labelings of trees (Q1671360) (← links)
- Low and light 5-stars in 3-polytopes with minimum degree 5 and restrictions on the degrees of major vertices (Q1675168) (← links)
- 2-distance coloring of planar graphs with girth 5 (Q1679523) (← links)
- Heights of minor 5-stars in 3-polytopes with minimum degree 5 and no vertices of degree 6 and 7 (Q1690254) (← links)
- Upper bounds of \(r\)-hued colorings of planar graphs (Q1752467) (← links)
- New upper bounds on linear coloring of planar graphs (Q1757984) (← links)
- An optimal square coloring of planar graphs (Q1928491) (← links)
- The list \(L(2,1)\)-labeling of planar graphs with large girth (Q2039710) (← links)
- Distance two surjective labelling of paths and interval graphs (Q2045355) (← links)
- \(2\)-distance coloring of planar graphs with maximum degree \(5\) (Q2075520) (← links)
- Optimal frequency assignment and planar list \(L(2, 1)\)-labeling (Q2084641) (← links)