Pages that link to "Item:Q475814"
From MaRDI portal
The following pages link to Minimum total coloring of planar graph (Q475814):
Displaying 13 items.
- A note on the minimum number of choosability of planar graphs (Q266020) (← links)
- Total coloring of planar graphs without chordal 7-cycles (Q272520) (← links)
- Total coloring of planar graphs without short cycles (Q281812) (← links)
- A note on the minimum total coloring of planar graphs (Q326982) (← links)
- List edge and list total coloring of planar graphs with maximum degree 8 (Q328709) (← links)
- Total coloring of planar graphs without adjacent short cycles (Q512886) (← links)
- On \((p,1)\)-total labelling of planar graphs (Q512891) (← links)
- Minimum choosability of planar graphs (Q724728) (← links)
- Total colorings of embedded graphs with no 3-cycles adjacent to 4-cycles (Q1656911) (← links)
- The computational complexity of weighted vertex coloring for \(\{P_5,K_{2,3},K^+_{2,3}\}\)-free graphs (Q1996748) (← links)
- Total coloring of planar graphs without adjacent chordal 6-cycles (Q2410046) (← links)
- An efficient case for computing minimum linear arboricity with small maximum degree (Q2414123) (← links)
- Optimal channel assignment with list-edge coloring (Q2424801) (← links)
