An optimal square coloring of planar graphs
From MaRDI portal
Publication:1928491
Recommendations
- Coloring the square of a planar graph
- Improved square coloring of planar graphs
- Exact square coloring of subcubic planar graphs
- Coloring the square of maximal Planar graphs with diameter two
- On colorings of squares of outerplanar graphs
- Coloring the square of an outerplanar graph
- Exact square coloring of certain classes of graphs: complexity and algorithms
- scientific article; zbMATH DE number 1982173
- A bound on the chromatic number of the square of a planar graph
- Coloring the square of Sierpiński graphs
Cites work
- 2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six and \(\varDelta \geq 18\)
- A bound on the chromatic number of the square of a planar graph
- A channel assignment problem for optical networks modelled by Cayley graphs
- A coloring problem on the \(n\)-cube
- Choosability conjectures and multicircuits
- Coloring squares of planar graphs with girth six
- Coloring the square of a planar graph
- Labeling Planar Graphs with Conditions on Girth and Distance Two
- List injective colorings of planar graphs
- List-coloring the square of a subcubic graph
- Near-optimal conflict-free channel set assignments for an optical cluster-based hypercube network
- The square of a planar cubic graph is 7-colorable
Cited in
(38)- Optimal channel assignment and \(L(p,1)\)-labeling
- 2-distance coloring of planar graphs with girth 5
- The square of a planar cubic graph is 7-colorable
- List r-dynamic coloring of graphs with small maximum average degree
- Coloring a dominating set without conflicts: \(q\)-subset square coloring
- List 2-distance coloring of planar graphs with girth five
- Sharp upper bound of injective coloring of planar graphs with girth at least 5
- 2-distance list ( +2)-coloring of planar graphs with girth at least 10
- Graph \(r\)-hued colorings -- a survey
- \(r\)-hued \((r+1)\)-coloring of planar graphs with girth at least 8 for \(r\geq 9\)
- List \(r\)-dynamic coloring of sparse graphs
- Optimal \(r\)-dynamic coloring of sparse graphs
- Coloring squares of planar graphs with girth six
- A bound on the chromatic number of the square of a planar graph
- Improved square coloring of planar graphs
- Coloring squares of planar graphs with maximum degree at most five
- List 2-distance coloring of planar graphs without short cycles
- An improved bound on 2-distance coloring plane graphs with girth 5
- On square-free edge colorings of graphs
- Coloring the square of a sparse graph G with almost (G) colors
- A new result of list 2-distance coloring of planar graphs with g(G) 5
- On 2-distance coloring of plane graphs with girth 5
- 2-distance coloring of planar graphs without 4-cycles and 5-cycles
- 2-distance chromatic number of some graph products
- Colouring a dominating set without conflicts: \(q\)-subset square colouring
- Square Coloring Planar Graphs with Automatic Discharging
- Some results on 2-distance coloring of planar graphs with girth five
- Relaxation of Wegner's planar graph conjecture for maximum degree 4
- 2-distance \((\Delta + 1)\)-coloring of sparse graphs using the potential method
- An improved bound for 2-distance coloring of planar graphs with girth six
- On odd and strong odd colorings of graphs
- 2-distance coloring of planar graphs without 4, 6-cycles
- On strong odd colorings of graphs
- 2-distance 4-coloring of planar subcubic graphs with girth at least 21
- On 2-distance ( + 4)-coloring of planar graphs with girth five
- Strong odd coloring of sparse graphs
- List 2-distance coloring of planar graphs
- On \(r\)-hued coloring of planar graphs with girth at least 6
This page was built for publication: An optimal square coloring of planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1928491)
