Odd Hadwiger number and graph products
classification
🧮 math.CO
keywords
graphhadwigernumberproductslexicographicstrongboundcartesian
read the original abstract
The Odd Hadwiger number of a graph $G$ is the largest integer $r$ such that $G$ has a clique of size $r$ as an odd minor. In this paper, we investigate how large is the Odd Hadwiger number of the product of two graphs, when considering any of the four standard graph products: Cartesian, direct, lexicographic, strong. We provide an optimal lower bound in the cases of the strong and lexicographic products.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.