Fractional coloring of triangle-free planar graphs (Q888619): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 16:58, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fractional coloring of triangle-free planar graphs |
scientific article |
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
