Pages that link to "Item:Q5931450"
From MaRDI portal
The following pages link to 25 pretty graph colouring problems (Q5931450):
Displaying 5 items.
- Facial colorings using Hall's theorem (Q966152) (← links)
- Every circle graph of girth at least 5 is 3-colourable (Q1296984) (← links)
- Edge coloring regular graphs of high degree (Q1356779) (← links)
- \(F\)-WORM colorings: results for 2-connected graphs (Q2403800) (← links)
- The \(L(2,1)\)-labeling on graphs and the frequency assignment problem (Q2472818) (← links)
