Pages that link to "Item:Q4797924"
From MaRDI portal
The following pages link to Coloring the square of a planar graph (Q4797924):
Displayed 42 items.
- Coloring a dominating set without conflicts: \(q\)-subset square coloring (Q2097209) (← links)
- Wegner's conjecture on 2-distance coloring (Q2151384) (← links)
- Wegner's conjecture on 2-distance coloring for planar graphs (Q2152439) (← links)
- Sharp upper bound of injective coloring of planar graphs with girth at least 5 (Q2165276) (← links)
- A note on additive choice number of planar graphs (Q2172418) (← links)
- Soft 3-stars in sparse plane graphs (Q2212724) (← links)
- Subexponential algorithms for variants of the homomorphism problem in string graphs (Q2301363) (← links)
- \( L ( 2 , 1 )\)-labeling of disk intersection graphs (Q2306585) (← links)
- 2-distance colorings of some direct products of paths and cycles (Q2346336) (← links)
- Linear-time algorithms for tree root problems (Q2346968) (← links)
- \((d,1)\)-total labelling of planar graphs with large girth and high maximum degree (Q2370454) (← links)
- Coloring squares of planar graphs with girth six (Q2427536) (← links)
- A unified approach to distance-two colouring of graphs on surfaces (Q2439826) (← links)
- \(L(2,1)\)-labeling of oriented planar graphs (Q2446298) (← links)
- Labelling of some planar graphs with a condition at distance two (Q2454996) (← links)
- Labeling planar graphs with a condition at distance two (Q2461777) (← links)
- On the existence of specific stars in planar graphs (Q2464048) (← links)
- Chromatic number of square of maximal outerplanar graphs (Q2466444) (← links)
- A survey on the distance-colouring of graphs (Q2468029) (← links)
- On the \(L(p,1)\)-labelling of graphs (Q2476282) (← links)
- A bound on the chromatic number of the square of a planar graph (Q2485944) (← links)
- The \(L(2,1)\)-labelling of trees (Q2489954) (← links)
- 5-stars of low weight in normal plane maps with minimum degree 5 (Q2509542) (← links)
- Light 3-stars in sparse plane graphs (Q2633370) (← links)
- Improved square coloring of planar graphs (Q2685324) (← links)
- Coloring squares of planar graphs with maximum degree at most five (Q2689129) (← links)
- On \(L (p, q)\)-labelling of planar graphs without cycles of length four (Q2698183) (← links)
- 2-distance choosability of planar graphs with a restriction for maximum degree (Q2698256) (← links)
- List 2-distance coloring of planar graphs without short cycles (Q2798330) (← links)
- Distance Constrained Labelings of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msub><mml:mi>K</mml:mi><mml:mn>4</mml:mn></mml:msub></mml:math>-minor Free Graphs (Q3439631) (← links)
- On Radiocoloring Hierarchically Specified Planar Graphs: $$\mathcal{PSPACE}$$ -completeness and Approximations (Q3464470) (← links)
- NEIGHBOR SUM DISTINGUISHING COLORING OF SOME GRAPHS (Q4903632) (← links)
- List‐Coloring the Squares of Planar Graphs without 4‐Cycles and 5‐Cycles (Q4978441) (← links)
- Angular Resolutions: Around Vertices and Crossings (Q5001662) (← links)
- 2-Distance coloring of planar graph (Q5012803) (← links)
- 2-Distance Coloring of Planar Graphs without 4-Cycles and 5-Cycles (Q5232154) (← links)
- 2-Distance chromatic number of some graph products (Q5854751) (← links)
- Coloring the square of maximal Planar graphs with diameter two (Q6048644) (← links)
- Colouring a dominating set without conflicts: \(q\)-subset square colouring (Q6077071) (← links)
- L(2,1,1)-labeling of interval graphs (Q6107729) (← links)
- 2-distance coloring of planar graphs without adjacent 5-cycles (Q6166190) (← links)
- 2-Distance coloring of planar graphs without triangles and intersecting 4-cycles (Q6174168) (← links)