The following pages link to (Q5613121):
Displayed 17 items.
- Nordhaus-Gaddum results for the induced path number of a graph when neither the graph nor its complement contains isolates (Q293628) (← links)
- Multiple factor Nordhaus-Gaddum type results for domination and total domination (Q423926) (← links)
- Graph factorization and theorems of the Nordhaus-Gaddum class (Q802576) (← links)
- Relations between parameters of a graph (Q802633) (← links)
- Super dominating sets in graphs (Q890164) (← links)
- Nordhaus-Gaddum inequalities for the fractional and circular chromatic numbers (Q1025479) (← links)
- Bidegree of graph and degeneracy number (Q1326070) (← links)
- Inequalities for the chromatic numbers of graphs (Q1393405) (← links)
- A Nordhaus-Gaddum-type result for the induced path number (Q1928519) (← links)
- Nordhaus-Gaddum results for the sum of the induced path number of a graph and its complement (Q1941298) (← links)
- Improving a Nordhaus-Gaddum type bound for total domination using an algorithm involving vertex disjoint stars (Q2357136) (← links)
- Nordhaus-Gaddum bounds for total domination (Q2430063) (← links)
- (Q4018724) (← links)
- Nordhaus-Gaddum inequalities for the number of connected induced subgraphs in graphs (Q5039404) (← links)
- (Q5228101) (← links)
- Graph colourings and partitions (Q5941502) (← links)
- Extremal decompositions for Nordhaus-Gaddum theorems (Q6046167) (← links)