A Note on Graph Characteristics and Hadwiger's Conjecture

MaRDI QIDQ6231688zbMATH OpenFDO

Authors Hanbaek Lyu

Publication date 16 March 2012

Abstract: This is a note on three graph parameters motivated by the Euler-Poincare characteristic for simplicial complex. We show those three graph parameters of a given connected graph $G$ is greater than or equal to that of the complete graph with $max(h(G),chi(G))$ vertices. This will yield three different simultaneous upperbounds of both the hadwiger number and chromatic number by means of the number of particular types of induced subgraphs. Some applications to Hadwiger's Conjecture is also discussed.

This page was built for publication: A Note on Graph Characteristics and Hadwiger's Conjecture

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6231688)