liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Hadwigers Conjecture for inflations of 3-chromatic graphs
Linköping University, Department of Mathematics, Mathematics and Applied Mathematics. Linköping University, Faculty of Science & Engineering.
University of Southern Denmark, Denmark; Aarhus University Hospital, Denmark.
2016 (English)In: European journal of combinatorics (Print), ISSN 0195-6698, E-ISSN 1095-9971, Vol. 51, 99-108 p.Article in journal (Refereed) Published
Abstract [en]

Hadwigers Conjecture states that every k-chromatic graph has a complete minor of order k. A graph G is an inflation of a graph G if G is obtained from G by replacing each vertex upsilon of G by a clique C-upsilon and joining two vertices of distinct cliques by an edge if and only if the corresponding vertices of G are adjacent. We present an algorithm for computing an upper bound on the chromatic number chi (G) of any inflation G of any 3-chromatic graph G. As a consequence, we deduce that Hadwigers Conjecture holds for any inflation of any 3-colorable graph. (C) 2015 Elsevier Ltd. All rights reserved.

Place, publisher, year, edition, pages
ACADEMIC PRESS LTD- ELSEVIER SCIENCE LTD , 2016. Vol. 51, 99-108 p.
National Category
Discrete Mathematics
Identifiers
URN: urn:nbn:se:liu:diva-122185DOI: 10.1016/j.ejc.2015.05.003ISI: 000362144400007OAI: oai:DiVA.org:liu-122185DiVA: diva2:865071
Note

Funding Agencies|SVeFUM; Mittag-Leffler Institute

Available from: 2015-10-26 Created: 2015-10-23 Last updated: 2017-12-01

Open Access in DiVA

fulltext(214 kB)51 downloads
File information
File name FULLTEXT01.pdfFile size 214 kBChecksum SHA-512
76dbe74ca28aa56d683355e35c69dae8b9d763c832f795f2266266dba6d38f9afd1cd1f41cd905da390d8f78f8d0e040d0e645f5cfba3119a2700dece063b249
Type fulltextMimetype application/pdf

Other links

Publisher's full text

Authority records BETA

Casselgren, Carl Johan

Search in DiVA

By author/editor
Casselgren, Carl Johan
By organisation
Mathematics and Applied MathematicsFaculty of Science & Engineering
In the same journal
European journal of combinatorics (Print)
Discrete Mathematics

Search outside of DiVA

GoogleGoogle Scholar
Total: 51 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 136 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf