A Note on Vertex List Colouring
From MaRDI portal
Publication:2757076
DOI10.1017/S0963548301004758zbMath0986.05042OpenAlexW2119305988MaRDI QIDQ2757076
Publication date: 3 June 2002
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0963548301004758
Related Items (49)
Complete subgraphs in a multipartite graph ⋮ Asymmetric list sizes in bipartite graphs ⋮ Independent transversals in bipartite correspondence-covers ⋮ Bounded transversals in multipartite graphs ⋮ Independent transversals in locally sparse graphs ⋮ An average degree condition for independent transversals ⋮ A General Framework for Hypergraph Coloring ⋮ Fair splittings by independent sets in sparse graphs ⋮ Graphs with $\chi=\Delta$ Have Big Cliques ⋮ Combinatorics. Abstracts from the workshop held January 1--7, 2023 ⋮ The list linear arboricity of graphs ⋮ When removing an independent set is optimal for reducing the chromatic number ⋮ A note on \(\Delta\)-critical graphs ⋮ Colorings, transversals, and local sparsity ⋮ Asymptotically good edge correspondence colourings ⋮ Strong coloring 2‐regular graphs: Cycle restrictions and partial colorings ⋮ List Colouring Constants of Triangle Free Graphs ⋮ Large cliques in graphs with high chromatic number ⋮ Graphs of low average degree without independent transversals ⋮ Distributed algorithms, the Lovász local lemma, and descriptive combinatorics ⋮ Bounded size components -- partitions and transversals. ⋮ On the maximal number of elements pairwise generating the finite alternating group ⋮ Cooperative colorings of forests ⋮ Sets of elements that pairwise generate a linear group ⋮ On an \(f\)-coloring generalization of linear arboricity of multigraphs ⋮ On triangle-free list assignments ⋮ Packing list‐colorings ⋮ New bounds for the Moser‐Tardos distribution ⋮ Problems and results in extremal combinatorics. I. ⋮ Unnamed Item ⋮ Independent systems of representatives in weighted graphs ⋮ An asymptotically tight bound on the adaptable chromatic number ⋮ On finite simple groups and Kneser graphs. ⋮ Entropy compression versus Lovász local lemma ⋮ Acyclic systems of representatives and acyclic colorings of digraphs ⋮ Hitting all maximum cliques with a stable set using lopsided independent transversals ⋮ Independent coverings and orthogonal colourings ⋮ On hitting all maximum cliques with an independent set ⋮ Cooperative colorings of trees and of bipartite graphs ⋮ Distributed algorithms for the Lovász local lemma and graph coloring ⋮ An asymptotic bound for the strong chromatic number ⋮ Defective and clustered choosability of sparse graphs ⋮ An Improvement of the Lovász Local Lemma via Cluster Expansion ⋮ Finding independent transversals efficiently ⋮ Asymptotically the list colouring constants are 1 ⋮ A note on coloring vertex-transitive graphs ⋮ The chromatic discrepancy of graphs ⋮ Cooperative colorings and independent systems of representatives ⋮ Distributed coloring algorithms for triangle-free graphs
This page was built for publication: A Note on Vertex List Colouring
