Pages that link to "Item:Q2347810"
From MaRDI portal
The following pages link to Distributed coloring algorithms for triangle-free graphs (Q2347810):
Displaying 21 items.
- Distributed colorings for collision-free routing in sink-centric sensor networks (Q450566) (← links)
- The list chromatic number of graphs with small clique number (Q1633755) (← links)
- Distributed algorithms for fractional coloring (Q2117704) (← links)
- Distributed graph problems through an automata-theoretic Lens (Q2117706) (← links)
- Bounding \(\chi\) by a fraction of \(\Delta\) for graphs without large cliques (Q2171021) (← links)
- Distributed minimum vertex coloring and maximum independent set in chordal graphs (Q2672608) (← links)
- Distributed graph problems through an automata-theoretic lens (Q2689441) (← links)
- Some Results on Chromatic Number as a Function of Triangle Count (Q3122312) (← links)
- An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model (Q4620411) (← links)
- A Time Hierarchy Theorem for the LOCAL Model (Q4646447) (← links)
- (Q5092335) (← links)
- Distributed Coloring in Sparse Graphs with Fewer Colors (Q5197707) (← links)
- Colouring graphs with forbidden bipartite subgraphs (Q5885184) (← links)
- Fast distributed algorithms for testing graph properties (Q5915702) (← links)
- Distributed algorithms for the Lovász local lemma and graph coloring (Q5920074) (← links)
- (Q6084349) (← links)
- Distributed algorithms, the Lovász local lemma, and descriptive combinatorics (Q6107878) (← links)
- Component stability in low-space massively parallel computation (Q6126138) (← links)
- On triangle-free list assignments (Q6184549) (← links)
- Fast distributed algorithms for girth, cycles and small subgraphs (Q6535032) (← links)
- Fractional coloring with local demands and applications to degree-sequence bounds on the independence number (Q6615757) (← links)
