Multi-part Nordhaus-Gaddum type problems for tree-width, Colin de Verdière type parameters, and Hadwiger number
Leslie Hogben,
Jephian C. -H. Lin,
Michael Young
Abstract:A traditional Nordhaus-Gaddum problem for a graph parameter β is to find a (tight) upper or lower bound on the sum or product of β(G) and β(G) (where G denotes the complement of G). An r-decomposition G 1 , . . . , G r of the complete graph K n is a partition of the edges of K n among r spanning subgraphs G 1 , . . . , G r . A traditional Nordhaus-Gaddum problem can be viewed as the special case for r = 2 of a more general r-part sum or product Nordhaus-Gaddum type problem. We determine the values of the r-par… Show more
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.