Pages that link to "Item:Q2277479"
From MaRDI portal
The following pages link to An upper bound for the total chromatic number (Q2277479):
Displaying 15 items.
- Randomly colouring graphs (a combinatorial view) (Q458462) (← 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)
- The total chromatic number of nearly complete bipartite graphs (Q1179463) (← links)
- List edge chromatic number of graphs with large girth (Q1197027) (← links)
- Fractionally colouring total graphs (Q1316649) (← links)
- The total chromatic number of regular graphs whose complement is bipartite (Q1318798) (← links)
- Recent developments in total colouring (Q1322273) (← links)
- The total chromatic number of any multigraph with maximum degree five is at most seven (Q1356668) (← links)
- Extending fixed vertex-colourings to total colourings (Q1377889) (← links)
- A new upper bound for total colourings of graphs (Q1842182) (← links)
- Total-coloring of sparse graphs with maximum degree 6 (Q2240657) (← links)
- Some upper bounds on the total and list chromatic numbers of multigraphs (Q4020707) (← links)
- An Improvement of Hind's Upper Bound on the Total Chromatic Number (Q4715258) (← links)
