scientific article; zbMATH DE number 889958
From MaRDI portal
Publication:4882474
Recommendations
Cited in
(21)- On structure of some plane graphs with application to choosability
- On a Conjecture of Erdős, Gallai, and Tuza
- Complexity of choosing subsets from color sets
- Choosability and fractional chromatic numbers
- On the colorability of \(m\)-composed graphs
- On list critical graphs
- List colorings and reducibility
- The strong fractional choice number of 3‐choice‐critical graphs
- Weak degeneracy of planar graphs and locally planar graphs
- extremal aspects of the Erdős-Gallai-Tuza conjecture
- Spanning Trees—Short or Small
- The analogue of Erdős-Turán conjecture in \(\mathbb Z_m\)
- The Strong Fractional Choice Number and the Strong Fractional Paint Number of Graphs
- On the Alon-Tarsi number and chromatic-choosability of Cartesian products of graphs
- Orientations of graphs with prescribed weighted out-degrees
- Multiple list coloring of 3‐choice critical graphs
- Flexible list colorings in graphs with special degeneracy conditions
- scientific article; zbMATH DE number 825142 (Why is no real title available?)
- Some results on \((a:b)\)-choosability
- Strengthening \((a,b)\)-choosability results to \((a,b)\)-paintability
- List coloring a Cartesian product with a complete bipartite factor
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4882474)
