Pages that link to "Item:Q686500"
From MaRDI portal
The following pages link to An upper bound for total colouring of graphs (Q686500):
Displaying 4 items.
- Total chromatic number of generalized Mycielski graphs (Q396736) (← links)
- The total chromatic number of graphs having large maximum degree (Q686156) (← links)
- Simultaneously colouring the edges and faces of plane graphs (Q1354728) (← links)
- A new upper bound for total colourings of graphs (Q1842182) (← links)
