An improved bound for the strong chromatic number
From MaRDI portal
Publication:3506316
DOI10.1002/jgt.20300zbMath1149.05017OpenAlexW4245876577MaRDI QIDQ3506316
Publication date: 12 June 2008
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20300
Related Items (9)
Deterministic algorithms for the Lovász local lemma: Simpler, more general, and more parallel ⋮ Strong coloring 2‐regular graphs: Cycle restrictions and partial colorings ⋮ Graphs of low average degree without independent transversals ⋮ Packing list‐colorings ⋮ Fractional total colourings of graphs of high girth ⋮ Two disjoint independent bases in matroid-graph pairs ⋮ An asymptotic bound for the strong chromatic number ⋮ Finding independent transversals efficiently ⋮ A note on coloring vertex-transitive graphs
Cites Work
This page was built for publication: An improved bound for the strong chromatic number
