Asymmetric list sizes in bipartite graphs

DOI10.1007/S00026-021-00552-5zbMath1479.05087arXiv2004.07457OpenAlexW3197870094MaRDI QIDQ825958

Ross J. Kang, Stijn Cambie, Noga Alon

Publication date: 18 December 2021

Published in: Annals of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

graph coloringchoice numberL-colouring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (5)

Independent transversals in bipartite correspondence-covers ⋮ On the subspace choosability in graphs ⋮ Coloring bipartite graphs with semi-small list size ⋮ Graph and hypergraph colouring via nibble methods: a survey ⋮ Packing list‐colorings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hypergraph containers
• The choice number of random bipartite graphs
• The list chromatic number of graphs with small clique number
• A Note on Vertex List Colouring
• List Coloring with a Bounded Palette
• Independent Transversals in Sparse Partite Hypergraphs
• Coloring triangle‐free graphs with local list sizes
• Single‐conflict colouring

This page was built for publication: Asymmetric list sizes in bipartite graphs