The round-up property of the fractional chromatic number for proper circular arc graphs

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(200004)33:4<256::AID-JGT7>3.0.CO;2-2" /><256::AID-JGT7>3.0.CO;2-2 10.1002/(SICI)1097-0118(200004)33:4<256::AID-JGT7>3.0.CO;2-2zbMath0944.05039OpenAlexW4253698849MaRDI QIDQ4948754

Thomas Niessen, Jaakob Kind

Publication date: 15 September 2000

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(200004)33:4<256::aid-jgt7>3.0.co;2-2

zbMATH Keywords

fractional chromatic numbercircular arc graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (8)

Asymptotics of the chromatic number for quasi-line graphs ⋮ Coloring fuzzy circular interval graphs ⋮ Approximate strong separation with application in fractional graph coloring and preemptive scheduling. ⋮ A superlocal version of Reed's conjecture ⋮ Bounding χ in terms of ω and Δ for quasi-line graphs ⋮ Fractional path coloring in bounded degree trees with applications ⋮ Claw‐Free Graphs, Skeletal Graphs, and a Stronger Conjecture on ω, Δ, and χ ⋮ Perfect circular arc coloring

Cites Work

• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms

This page was built for publication: The round-up property of the fractional chromatic number for proper circular arc graphs