Pages that link to "Item:Q5711696"
From MaRDI portal
The following pages link to Nordhaus–Gaddum‐type Theorems for decompositions into many parts (Q5711696):
Displayed 11 items.
- Maximum size of digraphs with some parameters (Q326498) (← links)
- Nordhaus-Gaddum for treewidth (Q412239) (← links)
- 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)
- Nordhaus-Gaddum inequalities for the fractional and circular chromatic numbers (Q1025479) (← links)
- Improving a Nordhaus-Gaddum type bound for total domination using an algorithm involving vertex disjoint stars (Q2357136) (← links)
- Ramsey numbers for degree monotone paths (Q2374167) (← links)
- Nordhaus-Gaddum bounds for total domination (Q2430063) (← links)
- A map colour theorem for the union of graphs (Q2581497) (← links)
- NORDHAUS–GADDUM-TYPE THEOREM FOR DIAMETER OF GRAPHS WHEN DECOMPOSING INTO MANY PARTS (Q2890987) (← links)
- Inequalities for the first-fit chromatic number (Q3528161) (← links)