Bibliographic Details
| Title: |
CLIQUE MINORS IN SOME GRAPHS WITH INDEPENDENCE NUMBER TWO. |
| Authors: |
Zhang, Jie1 230320011@fzu.edu.cn, Deng, Zijian1 zj1329205716@163.com |
| Source: |
Advances & Applications in Discrete Mathematics. Feb2026, Vol. 43 Issue 2, p155-166. 12p. |
| Subjects: |
Graph theory, Independent sets, Graph coloring |
| Abstract: |
The Hadwiger number of a graph G, denoted by h(G) is the largest integer t such that G contains a Kt-minor. A famous conjecture due to Hadwiger in 1943 states that for every graph G, h(G) ≥ χ(G) where χ(G) denotes the chromatic number of G. A graph is H-free if it does not contain the graph H as an induced subgraph. In this paper, we prove that the Hadwiger conjecture holds for H-free graphs with independence number two, where H is a specific graph on 7 or 8 vertices. [ABSTRACT FROM AUTHOR] |
|
Copyright of Advances & Applications in Discrete Mathematics is the property of Pushpa Publishing House and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
