Pages that link to "Item:Q4013421"
From MaRDI portal
The following pages link to An upper bound for the total chromatic number of dense graphs (Q4013421):
Displaying 13 items.
- Dense uniform hypergraphs have high list chromatic number (Q432708) (← links)
- The total chromatic number of graphs having large maximum degree (Q686156) (← links)
- Recent results on the total chromatic number (Q686483) (← links)
- An upper bound for total colouring of graphs (Q686500) (← links)
- Some colouring problems for Paley graphs (Q817760) (← links)
- Recent developments in total colouring (Q1322273) (← links)
- Extending fixed vertex-colourings to total colourings (Q1377889) (← links)
- A new upper bound for total colourings of graphs (Q1842182) (← links)
- Generalization of two results of Hilton on total-colourings of a graph (Q1893175) (← links)
- A dualistic approach to bounding the chromatic number of a graph (Q2462336) (← links)
- Some upper bounds on the total and list chromatic numbers of multigraphs (Q4020707) (← links)
- Tomescu's Graph Coloring Conjecture for $\ell$-Connected Graphs (Q4997140) (← links)
- Coloring Graphs with Dense Neighborhoods (Q5495890) (← links)