Chromatic number of square of maximal outerplanar graphs
From MaRDI portal
Recommendations
Cites work
- A bound on the chromatic number of the square of a planar graph
- Circular Distance Two Labeling and the $\lambda$-Number for Outerplanar Graphs
- Coloring the square of a \(K_{4}\)-minor free graph
- Coloring the square of a planar graph
- Labeling Planar Graphs with Conditions on Girth and Distance Two
- Note on coloring the square of an outerplanar graph
- \(L(h,1)\)-labeling subclasses of planar graphs
Cited in
(9)- A note on the chromatic number of the square of the Cartesian product of two cycles
- On colorings of squares of outerplanar graphs
- Coloring the square of an outerplanar graph
- Note on coloring the square of an outerplanar graph
- Upper bound on chromatic number of square graph of sparse graphs
- Graph \(r\)-hued colorings -- a survey
- Coloring squares of planar graphs with maximum degree at most five
- scientific article; zbMATH DE number 6837048 (Why is no real title available?)
- Vertex coloring the square of outerplanar graphs of low degree
This page was built for publication: Chromatic number of square of maximal outerplanar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2466444)