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

DOI10.1002/(SICI)1097-0118(200004)33:4%3C256::AID-JGT7%3E3.0.CO;2-2zbMATH Open0944.05039OpenAlexW4253698849MaRDI QIDQ4948754FDOQ4948754

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%3C256::aid-jgt7%3E3.0.co;2-2

Recommendations

• On the circular chromatic number of circular partitionable graphs
• Integer round-up property for the chromatic number of some \(h\)-perfect graphs
• Circular chromatic number: A survey
• Circular chromatic number of subgraphs

zbMATH Keywords

fractional chromatic numbercircular arc graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

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

Cited In (8)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4948754)