Pages that link to "Item:Q4154883"
From MaRDI portal
The following pages link to Bounds on chromatic numbers of multiple factors of a complete graph (Q4154883):
Displayed 7 items.
- Multiple factor Nordhaus-Gaddum type results for domination and total domination (Q423926) (← links)
- Nordhaus-Gaddum-type theorem for Wiener index of graphs when decomposing into three parts (Q642989) (← links)
- Graph factorization and theorems of the Nordhaus-Gaddum class (Q802576) (← links)
- A Nordhaus-Gaddum-type result for the induced path number (Q1928519) (← links)
- Improving a Nordhaus-Gaddum type bound for total domination using an algorithm involving vertex disjoint stars (Q2357136) (← links)
- NORDHAUS–GADDUM-TYPE THEOREM FOR DIAMETER OF GRAPHS WHEN DECOMPOSING INTO MANY PARTS (Q2890987) (← links)
- (Q3879256) (← links)