Pages that link to "Item:Q1842182"
From MaRDI portal
The following pages link to A new upper bound for total colourings of graphs (Q1842182):
Displaying 8 items.
- An upper bound for total colouring of graphs (Q686500) (← links)
- Bounds for mean colour numbers of graphs (Q1405125) (← links)
- Strengthening the Lovász \(\theta(\overline G)\) bound for graph coloring (Q1774164) (← links)
- Upper bound in the Erdős-Hajnal problem of hypergraph coloring (Q1947784) (← links)
- On total colourings of graphs (Q2277476) (← links)
- Total Thue colourings of graphs (Q2340970) (← links)
- (Q3984938) (← links)
- Some new bounds for the maximum number of vertex colorings of a (v,e)-graph (Q4242963) (← links)