Pages that link to "Item:Q2472571"
From MaRDI portal
The following pages link to Coloring the square of an outerplanar graph (Q2472571):
Displaying 18 items.
- Coloring the square of Sierpiński graphs (Q497382) (← links)
- Coloring the square of the Cartesian product of two cycles (Q708380) (← links)
- Labelling planar graphs without 4-cycles with a condition on distance two (Q947103) (← links)
- Invalid proofs on incidence coloring (Q998399) (← links)
- 2-distance colorings of integer distance graphs (Q1717215) (← links)
- Injective chromatic number of outerplanar graphs (Q1722035) (← links)
- An optimal square coloring of planar graphs (Q1928491) (← links)
- \(L(p,q)\)-labeling of sparse graphs (Q1956243) (← links)
- The complexity of restricted star colouring (Q2161257) (← links)
- Graph \(r\)-hued colorings -- a survey (Q2172387) (← links)
- Packing colorings of subcubic outerplanar graphs (Q2198310) (← links)
- Chromatic number of square of maximal outerplanar graphs (Q2466444) (← links)
- A bound on the chromatic number of the square of a planar graph (Q2485944) (← links)
- Improved square coloring of planar graphs (Q2685324) (← links)
- Coloring squares of planar graphs with maximum degree at most five (Q2689129) (← links)
- List-colouring the square of an outerplanar graph. (Q2918556) (← links)
- Vertex coloring the square of outerplanar graphs of low degree (Q2997588) (← links)
- OPTIMAL RADIOCOLORING OF TREES (Q5221077) (← links)
