Pages that link to "Item:Q686500"
From MaRDI portal
The following pages link to An upper bound for total colouring of graphs (Q686500):
Displaying 19 items.
- Total chromatic number of generalized Mycielski graphs (Q396736) (← links)
- The total chromatic number of graphs having large maximum degree (Q686156) (← links)
- Fractional total colouring (Q807633) (← links)
- Fractionally colouring total graphs (Q1316649) (← links)
- Recent developments in total colouring (Q1322273) (← links)
- Simultaneously colouring the edges and faces of plane graphs (Q1354728) (← links)
- Uniquely total colorable graphs (Q1376076) (← links)
- Bounds for mean colour numbers of graphs (Q1405125) (← links)
- Sum coloring and interval graphs: A tight upper bound for the minimum number of colors (Q1827686) (← links)
- A new upper bound for total colourings of graphs (Q1842182) (← links)
- Upper bound in the Erdős-Hajnal problem of hypergraph coloring (Q1947784) (← links)
- Total Thue colourings of graphs (Q2340970) (← links)
- An upper bound for van der Waerden-like numbers using \(k\) colors (Q2366957) (← links)
- Bounded Max-colorings of Graphs (Q3060747) (← links)
- Totally colouring a graph with maximum degree four (Q3981368) (← links)
- (Q3984938) (← links)
- An upper bound for the total chromatic number of dense graphs (Q4013421) (← links)
- Total Coloring With $\Delta + \mbox\lowercasepoly(\log \Delta)$ Colors (Q4229408) (← links)
- An Upper Bound for List <i>T</i> -Colourings (Q4893602) (← links)
