Coloring the square of a planar graph
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Coloring Powers of Planar Graphs
- A bound on the chromatic number of the square of a planar graph
- 2-distance choosability of planar graphs with a restriction for maximum degree
- Optimal frequency assignment and planar list \(L(2, 1)\)-labeling
- List 2-distance coloring of planar graphs without short cycles
- Labelling of some planar graphs with a condition at distance two
- On the existence of specific stars in planar graphs
- On \(L (p, q)\)-labelling of planar graphs without cycles of length four
- Labeling planar graphs with a condition at distance two
- Coloring a dominating set without conflicts: \(q\)-subset square coloring
- On the square coloring of comparability graphs
- Gated independence in graphs
- \((d,1)\)-total labelling of planar graphs with large girth and high maximum degree
- Low minor 5-stars in 3-polytopes with minimum degree 5 and no 6-vertices
- Coloring the square of Sierpiński graphs
- A unified approach to distance-two colouring of graphs on surfaces
- Injective colorings of graphs with low average degree
- L(p,q)-labeling of a graph embeddable on the torus
- Locally injective k-colourings of planar graphs
- \(k-L(2,1)\)-labelling for planar graphs is NP-complete for \(k\geq 4\)
- New upper bounds on the \(L(2,1)\)-labeling of the skew and converse skew product graphs
- The distant-2 chromatic number of random proximity and random geometric graphs
- The \(L(2,1)\)-labeling on planar graphs
- Improved square coloring of planar graphs
- \(\lambda \)-backbone colorings along pairwise disjoint stars and matchings
- Linear-time algorithms for tree root problems
- Bounding clique size in squares of planar graphs
- Degeneracy and colorings of squares of planar graphs without 4-cycles
- Square Coloring Planar Graphs with Automatic Discharging
- Soft 3-stars in sparse plane graphs
- 2-distance coloring of planar graphs without adjacent 5-cycles
- Some results on 2-distance coloring of planar graphs with girth five
- \(L(p,q)\)-labelling of \(K_{4}\)-minor free graphs
- scientific article; zbMATH DE number 1982173 (Why is no real title available?)
- The \(\Delta ^{2}\)-conjecture for \(L(2,1)\)-labelings is true for total graphs
- Planar graphs have two-coloring number at most 8
- Coloring the square of a \(K_{4}\)-minor free graph
- Coloring squares of graphs with mad constraints
- 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
- Acyclic edge colorings of planar graphs and series parallel graphs
- Light 3-stars in sparse plane graphs
- Optimal channel assignment and \(L(p,1)\)-labeling
- Wegner's conjecture on 2-distance coloring for planar graphs
- Minimum 2-distance coloring of planar graphs and channel assignment
- 2-distance colorings of some direct products of paths and cycles
- Describing (d-2)-stars at d-vertices, d 5, in normal plane maps
- Describing 4-stars at 5-vertices in normal plane maps with minimum degree 5
- 2-distance coloring of planar graphs without 4-cycles and 5-cycles
- On the structural result on normal plane maps
- List-coloring the squares of planar graphs without 4-cycles and 5-cycles
- Randomly colouring graphs (a combinatorial view)
- Coloring the square of maximal Planar graphs with diameter two
- An improved bound on 2-distance coloring plane graphs with girth 5
- Note on coloring the square of an outerplanar graph
- Subexponential algorithms for variants of the homomorphism problem in string graphs
- Minimization of span in \(L(3,1)\)-labeling for a particular type of intersection graphs
- Heights of minor 5-stars in 3-polytopes with minimum degree 5 and no vertices of degree 6 and 7
- Distributed colorings for collision-free routing in sink-centric sensor networks
- Angular Resolutions: Around Vertices and Crossings
- On 2-distance coloring of plane graphs with girth 5
- Light and low 5-stars in normal plane maps with minimum degree 5
- scientific article; zbMATH DE number 1882350 (Why is no real title available?)
- On the \(L(p,1)\)-labelling of graphs
- Relaxation of Wegner's planar graph conjecture for maximum degree 4
- 2-distance chromatic number of some graph products
- The L(p, q)-labelling of planar graphs without 4-cycles
- L(p, q)-labeling of planar graphs with small girth
- scientific article; zbMATH DE number 1445362 (Why is no real title available?)
- 2-distance coloring of a planar graph without 3, 4, 7-cycles
- Wegner's conjecture on 2-distance coloring
- A general approach to distance-two colouring of graphs on surfaces
- The list \(L(2,1)\)-labeling of planar graphs with large girth
- Distance two surjective labelling of paths and interval graphs
- The List L(2, 1)-labeling of planar graphs
- Labelling planar graphs without 4-cycles with a condition on distance two
- Sufficient sparseness conditions for \(G^2\) to be \((\Delta + 1)\)-choosable, when \(\Delta \geq 5\)
- Distance constrained labelings of planar graphs with no short cycles
- Neighbor sum distinguishing coloring of some graphs
- Low stars in normal plane maps with minimum degree 4 and no adjacent 4-vertices
- Facial \(L(2, 1)\)-edge-labelings of trees
- Square Coloring of Planar Graphs with Maximum Degree at Most Five
- Colouring a dominating set without conflicts: \(q\)-subset square colouring
- Improved 2-distance coloring of planar graphs with maximum degree 5
- Some results on distance two labelling of outerplanar graphs
- \( L ( 2 , 1 )\)-labeling of disk intersection graphs
- The L(2,1)-labelling of trees
- 2-distance coloring of planar graphs with girth 5
- A note on additive choice number of planar graphs
- List 2-distance \(\varDelta +3\)-coloring of planar graphs without 4,5-cycles
- List Colouring Squares of Planar Graphs
- Distance constrained labelings of \(K_{4}\)-minor free graphs
- Upper bounds of r-hued colorings of planar graphs
- The 2-distance chromatic number of planar graphs without 3,4,8-cycles
- An optimal square coloring of planar graphs
- Low and light 5-stars in 3-polytopes with minimum degree 5 and restrictions on the degrees of major vertices
- \(2\)-distance coloring of planar graph
- An improved bound for 2-distance coloring of planar graphs with girth six
- \(L(2,1)\)-labeling of oriented planar graphs
- Upper bounds on the linear chromatic number of a graph
- Chromatic number of square of maximal outerplanar graphs
This page was built for publication: Coloring the square of a planar graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4797924)
