Generalized list colourings of graphs

DOI10.7151/dmgt.1016zbMath0845.05046OpenAlexW2038927817MaRDI QIDQ4882591

Ewa Drgas-Burchardt, Peter Mihók, Mieczysław Borowiecki

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

zbMATH Keywords

colouringchromatic numberhereditary propertylist colouringvertex partition number

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items (8)

Improper choosability of graphs of nonnegative characteristic ⋮ Improper Choosability and Property B ⋮ On Equitable List Arboricity of Graphs ⋮ Equitable list vertex colourability and arboricity of grids ⋮ Generalized DP-colorings of graphs ⋮ Generalized hypergraph coloring ⋮ Acyclic sum-list-colouring of cylinders ⋮ The last excluded case of Dirac's map‐color theorem for choosability

This page was built for publication: Generalized list colourings of graphs