View in EDS PDF Full Text

CLIQUE MINORS IN SOME GRAPHS WITH INDEPENDENCE NUMBER TWO.

Saved in:
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
FullText Links:
  – Type: pdflink
Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 193553802
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: CLIQUE MINORS IN SOME GRAPHS WITH INDEPENDENCE NUMBER TWO.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Zhang%2C+Jie%22">Zhang, Jie</searchLink><relatesTo>1</relatesTo><i> 230320011@fzu.edu.cn</i><br /><searchLink fieldCode="AR" term="%22Deng%2C+Zijian%22">Deng, Zijian</searchLink><relatesTo>1</relatesTo><i> zj1329205716@163.com</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Advances+%26+Applications+in+Discrete+Mathematics%22">Advances & Applications in Discrete Mathematics</searchLink>. Feb2026, Vol. 43 Issue 2, p155-166. 12p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Graph+theory%22">Graph theory</searchLink><br /><searchLink fieldCode="DE" term="%22Independent+sets%22">Independent sets</searchLink><br /><searchLink fieldCode="DE" term="%22Graph+coloring%22">Graph coloring</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: 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]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>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.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=193553802
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.17654/0974165826011
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 12
        StartPage: 155
    Subjects:
      – SubjectFull: Graph theory
        Type: general
      – SubjectFull: Independent sets
        Type: general
      – SubjectFull: Graph coloring
        Type: general
    Titles:
      – TitleFull: CLIQUE MINORS IN SOME GRAPHS WITH INDEPENDENCE NUMBER TWO.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Zhang, Jie
      – PersonEntity:
          Name:
            NameFull: Deng, Zijian
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 02
              Text: Feb2026
              Type: published
              Y: 2026
          Identifiers:
            – Type: issn-print
              Value: 09741658
          Numbering:
            – Type: volume
              Value: 43
            – Type: issue
              Value: 2
          Titles:
            – TitleFull: Advances & Applications in Discrete Mathematics
              Type: main
ResultId 1