Pages that link to "Item:Q2427536"
From MaRDI portal
The following pages link to Coloring squares of planar graphs with girth six (Q2427536):
Displaying 49 items.
- An improved bound on 2-distance coloring plane graphs with girth 5 (Q306114) (← links)
- Coloring the square of a sparse graph \(G\) with almost \(\varDelta(G)\) colors (Q317434) (← links)
- 2-distance coloring of a planar graph without 3, 4, 7-cycles (Q328716) (← links)
- Injective coloring of planar graphs with girth 6 (Q389479) (← links)
- Graphs with maximum degree \(\varDelta\geq 17\) and maximum average degree less than 3 are list 2-distance \((\varDelta +2)\)-colorable (Q393358) (← links)
- Coloring the square of Sierpiński graphs (Q497382) (← links)
- An introduction to the discharging method via graph coloring (Q507506) (← links)
- On 2-distance coloring of plane graphs with girth 5 (Q516880) (← links)
- Parameterized complexity of coloring problems: treewidth versus vertex cover (Q534566) (← links)
- Injective \((\Delta + 1)\)-coloring of planar graphs with girth 6 (Q536624) (← links)
- List injective colorings of planar graphs (Q615993) (← links)
- List 2-facial 5-colorability of plane graphs with girth at least 12 (Q658054) (← links)
- Coloring the square of the Cartesian product of two cycles (Q708380) (← links)
- Injective colorings of sparse graphs (Q710598) (← links)
- List injective coloring of planar graphs with girth \(g \geq 6\) (Q738861) (← links)
- List coloring the square of sparse graphs with large degree (Q740267) (← 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)
- Coloring the square of graphs whose maximum average degree is less than 4 (Q906469) (← links)
- Distance constrained labelings of planar graphs with no short cycles (Q967308) (← links)
- List 2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six (Q1024323) (← 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)
- List 2-distance \(\varDelta +3\)-coloring of planar graphs without 4,5-cycles (Q1631690) (← links)
- Planar graphs of girth at least five are square \((\delta + 2)\)-choosable (Q1633752) (← links)
- 2-distance coloring of planar graphs with girth 5 (Q1679523) (← links)
- The square of a planar cubic graph is 7-colorable (Q1682215) (← links)
- List \(r\)-hued chromatic number of graphs with bounded maximum average degrees (Q1709519) (← links)
- 2-distance colorings of integer distance graphs (Q1717215) (← links)
- 3-dynamic coloring of planar triangulations (Q1783610) (← links)
- An optimal square coloring of planar graphs (Q1928491) (← links)
- Optimal frequency assignment and planar list \(L(2, 1)\)-labeling (Q2084641) (← links)
- List 2-distance coloring of planar graphs with girth five (Q2155644) (← links)
- Sharp upper bound of injective coloring of planar graphs with girth at least 5 (Q2165276) (← links)
- 2-distance list \((\Delta +2)\)-coloring of planar graphs with girth at least 10 (Q2165285) (← links)
- Graph \(r\)-hued colorings -- a survey (Q2172387) (← links)
- On coloring numbers of graph powers (Q2174571) (← links)
- \(r\)-hued \((r+1)\)-coloring of planar graphs with girth at least 8 for \(r\geq 9\) (Q2225423) (← links)
- Linear-time algorithms for tree root problems (Q2346968) (← links)
- On the existence of specific stars in planar graphs (Q2464048) (← links)
- Degeneracy and colorings of squares of planar graphs without 4-cycles (Q2658379) (← links)
- 2-Distance Coloring of Sparse Graphs (Q2930038) (← links)
- (Q3170099) (← links)
- A new result of list 2-distance coloring of planar graphs with g(G) ≥ 5 (Q4577850) (← links)
- List‐Coloring the Squares of Planar Graphs without 4‐Cycles and 5‐Cycles (Q4978441) (← links)
- 2-Distance Coloring of Planar Graphs without 4-Cycles and 5-Cycles (Q5232154) (← links)
- The list 2-distance coloring of a graph with Δ(G) = 5 (Q5261051) (← links)
- 2-Distance chromatic number of some graph products (Q5854751) (← links)
- 2-distance \((\Delta + 1)\)-coloring of sparse graphs using the potential method (Q6635121) (← links)
