Pages that link to "Item:Q3506316"
From MaRDI portal
The following pages link to An improved bound for the strong chromatic number (Q3506316):
Displaying 9 items.
- Two disjoint independent bases in matroid-graph pairs (Q497297) (← links)
- Fractional total colourings of graphs of high girth (Q651031) (← links)
- A note on coloring vertex-transitive graphs (Q2341047) (← links)
- Finding independent transversals efficiently (Q4987260) (← links)
- An asymptotic bound for the strong chromatic number (Q5222554) (← links)
- Deterministic algorithms for the Lovász local lemma: Simpler, more general, and more parallel (Q6076732) (← links)
- Strong coloring 2‐regular graphs: Cycle restrictions and partial colorings (Q6081880) (← links)
- Graphs of low average degree without independent transversals (Q6093156) (← links)
- Packing list‐colorings (Q6185050) (← links)
