Pages that link to "Item:Q2966511"
From MaRDI portal
The following pages link to A note on 3-choosability of plane graphs under distance restrictions (Q2966511):
Displayed 5 items.
- Minimum 2-distance coloring of planar graphs and channel assignment (Q724734) (← links)
- Optimal channel assignment and \(L(p,1)\)-labeling (Q1630278) (← links)
- Neighbor sum distinguishing list total coloring of subcubic graphs (Q1743484) (← links)
- Planar graphs without chordal 5-cycles are 2-good (Q1743499) (← links)
- 3-Paintability of planar graphs (Q4554554) (← links)