Pages that link to "Item:Q1312961"
From MaRDI portal
The following pages link to The complete chromatic number of some planar graphs (Q1312961):
Displaying 6 items.
- The entire choosability of plane graphs (Q266053) (← links)
- \(D(\beta)\)-vertex-distinguishing total coloring of graphs (Q867795) (← links)
- Adjacent strong edge colorings and total colorings of regular graphs (Q1041555) (← links)
- On the complete chromatic number of Halin graphs (Q1363017) (← links)
- Plane graphs with maximum degree 9 are entirely 11-choosable (Q2629286) (← links)
- Edge-face total chromatic number of outerplanar graphs with Δ (G)=6 (Q6085733) (← links)
