Generalized list colourings of graphs
From MaRDI portal
Publication:4882591
Recommendations
Cited in
(23)- Equitable list vertex colourability and arboricity of grids
- On generalized choice and coloring numbers
- Improper choosability of graphs of nonnegative characteristic
- Brooks-Type Theorems for Pair-List Colorings and List Homomorphisms
- Gallai's theorem for list coloring of digraphs
- Partial list colouring of certain graphs
- List colouring of graphs and generalized Dyck paths
- Acyclic sum-list-colouring of cylinders
- scientific article; zbMATH DE number 6000769 (Why is no real title available?)
- Improper choosability and property B
- On group choosability of graphs. I.
- List-coloring embedded graphs
- The last excluded case of Dirac's map‐color theorem for choosability
- Generalized list \(T\)-colorings of cycles
- The chromatic polynomial and list colorings
- Generalized hypergraph coloring
- Generalized DP-colorings of graphs
- On equitable list arboricity of graphs
- scientific article; zbMATH DE number 4010540 (Why is no real title available?)
- On the number of list‐colorings
- Generalized list colouring of graphs
- Introduction to list colourings
- scientific article; zbMATH DE number 1341914 (Why is no real title available?)
This page was built for publication: Generalized list colourings of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4882591)