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