Fractional coloring of triangle-free planar graphs (Q888619)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6502797
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fractional coloring of triangle-free planar graphs |
scientific article; zbMATH DE number 6502797 |
Statements
Fractional coloring of triangle-free planar graphs (English)
0 references
2 November 2015
0 references
Summary: We prove that every planar triangle-free graph on \(n\) vertices has fractional chromatic number at most \(3-\frac{3}{3n+1}\).
0 references
fractional colouring
0 references
planar graphs
0 references
0.9408225
0 references
0.9288491
0 references
0.9285652
0 references
0.92363954
0 references
0.91888547
0 references
0 references
0.9150133
0 references
0.91448885
0 references
0.91296846
0 references
0.9116279
0 references
