Fractional coloring of triangle-free planar graphs

Abstract : We prove that every planar triangle-free graph on n vertices has fractional chromatic number at most 3-1/(n+1/3).
Document type :
Journal articles
Complete list of metadatas

Cited literature [14 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00950493
Contributor : Jean-Sébastien Sereni <>
Submitted on : Thursday, January 7, 2016 - 11:12:04 AM
Last modification on : Tuesday, August 6, 2019 - 1:10:12 AM
Long-term archiving on : Friday, April 8, 2016 - 1:18:12 PM

File

frpltr-ejc.pdf
Publisher files allowed on an open archive

Identifiers

  • HAL Id : hal-00950493, version 2

Collections

Citation

Zdeněk Dvořák, Jean-Sébastien Sereni, Jan Volec. Fractional coloring of triangle-free planar graphs. The Electronic Journal of Combinatorics, Open Journal Systems, 2015, 22 (4), pp.#P4.11. ⟨hal-00950493v2⟩

Share

Metrics

Record views

299

Files downloads

416