scientific article; zbMATH DE number 908794

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199607)22:3<245::AID-JGT5>3.0.CO;2-M" /><245::AID-JGT5>3.0.CO;2-M 10.1002/(SICI)1097-0118(199607)22:3<245::AID-JGT5>3.0.CO;2-MzbMath0853.05034MaRDI QIDQ4888118

Margit Voigt, Zsolt Tuza

Publication date: 9 December 1996

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

list coloringlist colorable

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (16)

Path choosability of planar graphs ⋮ Free choosability of outerplanar graphs ⋮ The Strong Fractional Choice Number and the Strong Fractional Paint Number of Graphs ⋮ Every triangle-free induced subgraph of the triangular lattice is \((5m,2m)\)-choosable ⋮ Fractional DP-chromatic number of planar graphs of large girth ⋮ Choosability and fractional chromatic numbers ⋮ List colorings and reducibility ⋮ Strengthening \((a,b)\)-choosability results to \((a,b)\)-paintability ⋮ The strong fractional choice number of 3‐choice‐critical graphs ⋮ Multiple list coloring of 3‐choice critical graphs ⋮ Some results on \((a:b)\)-choosability ⋮ Subcubic triangle-free graphs have fractional chromatic number at most 14/5 ⋮ Complexity of choosing subsets from color sets ⋮ On structure of some plane graphs with application to choosability ⋮ Characterization of \((2m,m)\)-paintable graphs ⋮ On (4, 2)‐Choosable Graphs

This page was built for publication: