Packing list‐colorings

DOI10.1002/rsa.21181zbMath1529.05057arXiv2110.05230OpenAlexW4385458881MaRDI QIDQ6185050

Ewan Davies, Wouter Cames van Batenburg, Stijn Cambie, Ross J. Kang

Publication date: 5 January 2024

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2110.05230

zbMATH Keywords

graph colouringgraph packinglist colouringindependent transversalsstrong chromatic number

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
• Asymmetric list sizes in bipartite graphs
• Extremal problems for transversals in graphs with bounded degree
• A note on the independence number of triangle-free graphs
• On a problem of Spencer
• The linear arboricity of graphs
• On Turan's theorem for sparse graphs
• The asymptotic number of (0,1)-matrices with zero permanent
• On complete subgraphs of \(r\)-chromatic graphs
• The choice number of random bipartite graphs
• Coloring graphs with sparse neighborhoods
• The list chromatic number of graphs with small clique number
• Asymptotically the list colouring constants are 1
• Independent coverings and orthogonal colourings
• Connectivity and choosability of graphs with no \(K_t\) minor
• Bipartite induced density in triangle-free graphs
• Independent transversals in locally sparse graphs
• Independent systems of representatives in weighted graphs
• The asymptotic behavior of the correspondence chromatic number
• On factors of independent transversals in \(k\)-partite graphs
• An average degree condition for independent transversals
• A Note on Vertex List Colouring
• On Forming Committees
• An improved bound for the strong chromatic number
• Choice Numbers of Graphs: a Probabilistic Approach
• Randomized Distributed Edge Coloring via an Extension of the Chernoff--Hoeffding Bounds
• Transversals of Vertex Partitions in Graphs
• On a list coloring conjecture of Reed
• A note on group colorings
• Inequalities for general matrix functions
• Colouring graphs with forbidden bipartite subgraphs
• Independent transversals in bipartite correspondence-covers
• Colorings, transversals, and local sparsity

This page was built for publication: Packing list‐colorings