Colouring graphs with forbidden bipartite subgraphs

DOI10.1017/S0963548322000104MaRDI QIDQ5885184

No author found.

Publication date: 3 April 2023

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

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

zbMATH Keywords

graph colouringbipartite subgraphRödl nibbleDP-colouring

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Coloring of graphs and hypergraphs (05C15)

Related Items (2)

Weak degeneracy of graphs ⋮ Packing list‐colorings

Cites Work

• Unnamed Item
• Unnamed Item
• Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
• Explicit construction of regular graphs without small cycles
• Explicit constructions of graphs without short cycles and low density codes
• Coloring graphs with sparse neighborhoods
• The list chromatic number of graphs with small clique number
• Local algorithms for independent sets are half-optimal
• Colouring graphs with sparse neighbourhoods: bounds and applications
• Distributed coloring algorithms for triangle-free graphs
• Quiet Planting in the Locked Constraint Satisfaction Problems
• List Colouring Constants of Triangle Free Graphs
• The Independence Ratio of Regular Graphs
• A Stronger Bound for the Strong Chromatic Index
• On Brooks' Theorem for Sparse Graphs
• The Johansson‐Molloy theorem for DP‐coloring
• On a problem of K. Zarankiewicz
• Graph colouring and the probabilistic method

This page was built for publication: Colouring graphs with forbidden bipartite subgraphs