Pages that link to "Item:Q4715258"
From MaRDI portal
The following pages link to An Improvement of Hind's Upper Bound on the Total Chromatic Number (Q4715258):
Displaying 4 items.
- Randomly colouring graphs (a combinatorial view) (Q458462) (← links)
- The total chromatic number of any multigraph with maximum degree five is at most seven (Q1356668) (← links)
- Total-coloring of sparse graphs with maximum degree 6 (Q2240657) (← links)
- An improved bound for the strong chromatic number (Q3506316) (← links)