scientific article; zbMATH DE number 7758308
From MaRDI portal
Publication:6084349
DOI10.4230/lipics.approx/random.2020.6arXiv2006.10456MaRDI QIDQ6084349
Publication date: 31 October 2023
Full work available at URL: https://arxiv.org/abs/2006.10456
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (4)
Colouring graphs with forbidden bipartite subgraphs ⋮ Independent transversals in bipartite correspondence-covers ⋮ On triangle-free list assignments ⋮ Distributed Symmetry Breaking on Power Graphs via Sparsification
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On a packing and covering problem
- Chromatic number, girth and maximal degree
- A bound on the strong chromatic index of a graph
- Coloring graphs with sparse neighborhoods
- The list chromatic number of graphs with small clique number
- Asymptotically the list colouring constants are 1
- Distributed coloring algorithms for triangle-free graphs
- A Note on Vertex List Colouring
- On the Lovász Theta function for Independent Sets in Sparse Graphs
- Set Partitioning via Inclusion-Exclusion
- On Brooks' Theorem for Sparse Graphs
- (Delta+1) Coloring in the Congested Clique Model
- Randomized (Delta+1)-Coloring in O(log* Delta) Congested Clique Rounds
- Coloring triangle‐free graphs with local list sizes
- The Complexity of (Δ+1) Coloring in Congested Clique, Massively Parallel Computation, and Centralized Local Computation
- The Johansson‐Molloy theorem for DP‐coloring
- An optimal distributed (Δ+1)-coloring algorithm?
- Sublinear Algorithms for (Δ + 1) Vertex Coloring
- Distributed (∆+1)-coloring in sublogarithmic rounds
- (2Δ — l)-Edge-Coloring is Much Easier than Maximal Matching in the Distributed Setting
- Introduction to Property Testing
- Graph colouring and the probabilistic method
This page was built for publication:
