On the Strong Chromatic Number

DOI10.1017/S0963548304006157zbMATH Open1062.05058OpenAlexW1965802316WikidataQ56390839 ScholiaQ56390839MaRDI QIDQ4650643FDOQ4650643

Penny 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)

Cited In (24)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4650643)