Cameron, K and Vuskovic, K (2020) Hadwiger's Conjecture for some hereditary classes of graphs: a survey. Bulletin of the European Association for Theoretical Computer Science (131). ISSN 0252-9742
Abstract
The famous Hadwiger’s Conjecture aims to understand reasons for a graph to have a large chromatic number. This is a survey of graph classes for which Hadwiger’s conjecture is known to hold.
Metadata
| Authors/Creators: |
|
||||
|---|---|---|---|---|---|
| Keywords: | Hadwiger's Conjecture; graph coloring; minor; hereditary graph class; cap-free graph | ||||
| Dates: |
|
||||
| Institution: | The University of Leeds | ||||
| Academic Units: | The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds) | ||||
| Funding Information: |
|
||||
| Depositing User: | Symplectic Publications | ||||
| Date Deposited: | 09 Sep 2020 14:36 | ||||
| Last Modified: | 15 Sep 2020 12:14 | ||||
| Published Version: | http://bulletin.eatcs.org/index.php/beatcs/index | ||||
| Status: | Published | ||||
| Publisher: | European Association for Theoretical Computer Science; 1999 | ||||
| Related URLs: |
Download not available
A full text copy of this item is not currently available from White Rose Research Online
CORE (COnnecting REpositories)
CORE (COnnecting REpositories)