On the Strong Chromatic Number

DOI10.1017/S0963548304006157zbMath1062.05058OpenAlexW1965802316WikidataQ56390839 ScholiaQ56390839MaRDI QIDQ4650643

Penny E. Haxell

Publication date: 18 February 2005

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548304006157

zbMATH Keywords

partitionindependent transversals

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (20)

Independent transversals in locally sparse graphs ⋮ On factors of independent transversals in \(k\)-partite graphs ⋮ An average degree condition for independent transversals ⋮ Topological methods for the existence of a rainbow matching ⋮ Strong coloring 2‐regular graphs: Cycle restrictions and partial colorings ⋮ Choice functions ⋮ Partitioning into common independent sets via relaxing strongly base orderability ⋮ Fractional total colourings of graphs of high girth ⋮ Independent systems of representatives in weighted graphs ⋮ Two disjoint independent bases in matroid-graph pairs ⋮ Chromatic numbers of layered graphs with a bounded maximal clique ⋮ Acyclic systems of representatives and acyclic colorings of digraphs ⋮ Hitting all maximum cliques with a stable set using lopsided independent transversals ⋮ Uniform coloring of graph ⋮ An asymptotic bound for the strong chromatic number ⋮ Finding independent transversals efficiently ⋮ Coloring Graphs with Dense Neighborhoods ⋮ Coloring by two-way independent sets ⋮ The intersection of a matroid and a simplicial complex ⋮ A note on coloring vertex-transitive graphs

This page was built for publication: On the Strong Chromatic Number