Coloring the square of an outerplanar graph
From MaRDI portal
Publication:2472571
Recommendations
Cited in
(23)- 2-distance colorings of integer distance graphs
- Injective chromatic number of outerplanar graphs
- An optimal square coloring of planar graphs
- L(p,q)-labeling of sparse graphs
- The complexity of restricted star colouring
- Graph \(r\)-hued colorings -- a survey
- Packing colorings of subcubic outerplanar graphs
- Chromatic number of square of maximal outerplanar graphs
- 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-colouring the square of an outerplanar graph.
- Vertex coloring the square of outerplanar graphs of low degree
- Note on coloring the square of an outerplanar graph
- Coloring the square of a planar graph
- Coloring the square of Sierpiński graphs
- Optimal radiocoloring of trees
- On colorings of squares of outerplanar graphs
- Coloring squares of graphs via vertex orderings
- Coloring the square of maximal Planar graphs with diameter two
- Coloring the square of the Cartesian product of two cycles
- Labelling planar graphs without 4-cycles with a condition on distance two
- Invalid proofs on incidence coloring
This page was built for publication: Coloring the square of an outerplanar graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2472571)
