Generalized list colourings of graphs
DOI10.7151/DMGT.1016zbMATH Open0845.05046OpenAlexW2038927817MaRDI QIDQ4882591FDOQ4882591
Authors: Mieczysław Borowiecki, Ewa Drgas-Burchardt, Peter Mihók
Publication date: 20 August 1996
Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/3577c1e0d249af3752a2108aa5d4335dfe85daae
Recommendations
Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cited In (19)
- Title not available (Why is that?)
- Equitable list vertex colourability and arboricity of grids
- Brooks-Type Theorems for Pair-List Colorings and List Homomorphisms
- Title not available (Why is that?)
- Partial list colouring of certain graphs
- Acyclic sum-list-colouring of cylinders
- Introduction to list colourings
- Generalized hypergraph coloring
- On the number of list‐colorings
- Title not available (Why is that?)
- Gallai's theorem for list coloring of digraphs
- Generalized list \(T\)-colorings of cycles
- Generalized DP-colorings of graphs
- Improper choosability of graphs of nonnegative characteristic
- On Equitable List Arboricity of Graphs
- List-coloring embedded graphs
- Improper Choosability and Property B
- The chromatic polynomial and list colorings
- The last excluded case of Dirac's map‐color theorem for choosability
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)