Coloring locally sparse graphs
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3140515 (Why is no real title available?)
- scientific article; zbMATH DE number 3735847 (Why is no real title available?)
- scientific article; zbMATH DE number 3563170 (Why is no real title available?)
- scientific article; zbMATH DE number 1299964 (Why is no real title available?)
- scientific article; zbMATH DE number 3043302 (Why is no real title available?)
- scientific article; zbMATH DE number 7758308 (Why is no real title available?)
- A bound on the strong chromatic index of a graph
- A strengthening of Brooks' theorem
- A stronger bound for the strong chromatic index (extended abstract)
- An average degree condition for independent transversals
- Asymmetric list sizes in bipartite graphs
- Asymptotically good list-colorings
- Asymptotically the list colouring constants are 1
- Coloring graphs with sparse neighborhoods
- Colorings, transversals, and local sparsity
- Colouring graphs with forbidden bipartite subgraphs
- Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
- Distributed coloring algorithms for triangle-free graphs
- Graph colouring and the probabilistic method
- Independent transversals in bipartite correspondence-covers
- Independent transversals in locally sparse graphs
- On Brooks' Theorem for Sparse Graphs
- On a list coloring conjecture of Reed
- On a packing and covering problem
- On a problem of K. Zarankiewicz
- On the independence number of sparse graphs
- On the structure of linear graphs
- Testing subgraphs in large graphs
- The Independence Ratio of Regular Graphs
- The Johansson-Molloy theorem for DP-coloring
- The list chromatic number of graphs with small clique number
This page was built for publication: Coloring locally sparse graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6841463)
