Estimating the fractional chromatic number of a graph

DOI10.2478/AUSI-2021-0006MaRDI QIDQ2236364OpenAlexFDO

Authors Sándor Szabó

Publication date 22 October 2021

Published in Acta Universitatis Sapientiae. Informatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2478/ausi-2021-0006

zbMATH Keywords

integer programmingfractional chromatic numberclique and chromatic numbers

Mathematics Subject Classification ID

Integer programming (90C10) Coloring of graphs and hypergraphs (05C15)

Recommendations

• A parallel lagrangian heuristic for the fractional chromatic number of a graph
• scientific article; zbMATH DE number 866060
• Choosability and fractional chromatic numbers
• Fractionally colouring total graphs
• The fractional chromatic number of infinite graphs

Cites work

• scientific article; zbMATH DE number 6118217 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• Monotonic matrices and clique search in graphs
• Test case generators and computational results for the maximum clique problem

Cited in

(3)

• Fractional chromatic number of a random subgraph
• Estimating quantum chromatic numbers
• A parallel lagrangian heuristic for the fractional chromatic number of a graph

This page was built for publication: Estimating the fractional chromatic number of a graph

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