On optimal \(k\)-fold colorings of webs and antiwebs

DOI10.1016/j.dam.2012.07.013zbMath1296.05068arXiv1108.5757OpenAlexW1562041694MaRDI QIDQ1759864

Phablo F. S. Moura, Marcio C. Santos, Ricardo C. Corrêa, Manoel B. Campêlo

Publication date: 22 November 2012

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1108.5757

zbMATH Keywords

fractional chromatic numberclique numberwebantiweb\(k\)-fold graph coloringstable set number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (4)

On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs ⋮ Generating irreducible copositive matrices using the stable set problem ⋮ Lifted, projected and subgraph-induced inequalities for the representatives \(k\)-fold coloring polytope ⋮ Channel assignment problem and \(n\)-fold \(t\)-separated \(L(j_1,j_2,\dots,j_m)\)-labeling of graphs

This page was built for publication: On optimal \(k\)-fold colorings of webs and antiwebs