Skip to content Skip to navigation
University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • |
  • About

University of Warwick
Publications service & WRAP

Highlight your research

  • WRAP
    • Home
    • Search WRAP
    • Browse by Warwick Author
    • Browse WRAP by Year
    • Browse WRAP by Subject
    • Browse WRAP by Department
    • Browse WRAP by Funder
    • Browse Theses by Department
  • Publications Service
    • Home
    • Search Publications Service
    • Browse by Warwick Author
    • Browse Publications service by Year
    • Browse Publications service by Subject
    • Browse Publications service by Department
    • Browse Publications service by Funder
  • Help & Advice
University of Warwick

The Library

  • Login
  • Admin

Beyond Ohba’s conjecture : a bound on the choice number of k-chromatic graphs with n vertices

Tools
- Tools
+ Tools

Noel, Jonathan A., West, Douglas B., Wu, Hehui and Zhu, Xuding (2015) Beyond Ohba’s conjecture : a bound on the choice number of k-chromatic graphs with n vertices. European Journal of Combinatorics, 43 . pp. 295-305. doi:10.1016/j.ejc.2014.08.032 ISSN 0195-6698.

[img]
Preview
PDF
WRAP-beyond-Ohbas-conjecture-choice-vertices-Noel-2015.pdf - Accepted Version - Requires a PDF viewer.
Available under License Creative Commons Attribution Non-commercial No Derivatives 4.0.

Download (615Kb) | Preview
Official URL: http://dx.doi.org/10.1016/j.ejc.2014.08.032

Request Changes to record.

Abstract

Let ch(G) denote the choice number of a graph G (also called “list chromatic number” or “choosability” of G . Noel, Reed, and Wu proved the conjecture of Ohba that ch(G) = χ (G) when | V (G) | ≤ 2 χ (G) + 1. We extend this to a general upper bound: ch(G) ≤ max { χ (G) , ⌈ ( | V (G) | + χ (G) − 1) / 3 ⌉} . Our result is sharp for | V (G) | ≤ 3 χ (G) using Ohba’s examples, and it improves the best-known upper bound for ch( K 4 ,..., 4).

Item Type: Journal Article
Subjects: Q Science > QA Mathematics
Divisions: Faculty of Science, Engineering and Medicine > Science > Computer Science
Library of Congress Subject Headings (LCSH): Bipartite graphs, Graph coloring
Journal or Publication Title: European Journal of Combinatorics
Publisher: Academic Press
ISSN: 0195-6698
Official Date: 2015
Dates:
DateEvent
2015Published
29 September 2014Available
27 August 2014Accepted
Volume: 43
Page Range: pp. 295-305
DOI: 10.1016/j.ejc.2014.08.032
Status: Peer Reviewed
Publication Status: Published
Access rights to Published version: Restricted or Subscription Access
Date of first compliant deposit: 10 July 2018
Date of first compliant Open Access: 11 July 2018
RIOXX Funder/Project Grant:
Project/Grant IDRIOXX Funder NameFunder ID
UNSPECIFIED[NSERC] Natural Sciences and Engineering Research Council of Canadahttp://dx.doi.org/10.13039/501100000038
11171310[NSFC] National Natural Science Foundation of Chinahttp://dx.doi.org/10.13039/501100001809
Z6110786Natural Science Foundation of Zhejiang Provincehttp://dx.doi.org/10.13039/501100004731

Request changes or add full text files to a record

Repository staff actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics

twitter

Email us: wrap@warwick.ac.uk
Contact Details
About Us