scientific article; zbMATH DE number 1299964

Cited in

(31)

The list chromatic number of graphs with small clique number
Asymptotically the list colouring constants are 1
Cooperative colorings and independent systems of representatives
Distributed coloring algorithms for triangle-free graphs
Independent transversals in locally sparse graphs
An average degree condition for independent transversals
List-colourings
List Colouring Constants of Triangle Free Graphs
The strong chromatic index ofC4-free graphs
Near-optimal list colorings
An asymptotically tight bound on the adaptable chromatic number
A general framework for hypergraph coloring
Distributed algorithms for the Lovász local lemma and graph coloring
Counting colorings of triangle-free graphs
Adaptable and conflict colouring multigraphs with no cycles of length three or four
Colorings, transversals, and local sparsity
Asymptotically good edge correspondence colourings
scientific article; zbMATH DE number 7758308 (Why is no real title available?)
Distributed algorithms, the Lovász local lemma, and descriptive combinatorics
On triangle-free list assignments
Packing list‐colorings
A precise condition for independent transversals in bipartite covers
Constructing graphs with no independent transversals
Fractional coloring with local demands and applications to degree-sequence bounds on the independence number
A special case of Vu's conjecture: colouring nearly disjoint graphs of bounded maximum degree
Coloring locally sparse graphs
Defective coloring of blowups
Bounded degree graphs and hypergraphs with no full rainbow matchings
Approximate packing of independent transversals in locally sparse graphs
A precise condition for independent transversals in bipartite covers (extended abstract)
The minimum number of vertices for a triangle-free graph with \(\chi _l(G)=4\) is \(11\)

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 Q4248539)