CLIQUE MINORS IN SOME GRAPHS WITH INDEPENDENCE NUMBER TWO
Abstract
The Hadwiger number of a graph , denoted by , is the largest integer such that contains a -minor. A famous conjecture due to Hadwiger in 1943 states that for every graph , where denotes the chromatic number of . A graph is -free if it does not contain the graph as an induced subgraph. In this paper, we prove that the Hadwiger conjecture holds for -free graphs with independence number two, where is a specific graph on 7 or 8 vertices.
Fields of Study & Subjects
Advanced Graph Theory Research
Limits and Structures in Graph Theory
Graph Labeling and Dimension Problems
Publication details
- Journal / source
- Advances and Applications in Discrete Mathematics
- Volume
- 43
- Issue
- 2
- Pages
- 155–166
- Publication date
- 8 January 2026