Decomposing hypergraphs into k-colorable hypergraphs

DOI10.22108/TOC.2014.5146MaRDI QIDQ5135787zbMATH OpenFDO

Authors Gholamreza Omidi, Khosro Tajbakhsh

Publication date 24 November 2020

Full work available at URL https://doi.org/10.22108/TOC.2014.5146

zbMATH Keywords

\(k\)-colorable graphchromatic numberhypergraph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Decomposable and indecomposable critical hypergraphs
• Hypergraph coverings and local colorings
• Minimum \(H\)-decompositions of graphs
• On decompositions of complete hypergraphs
• The list-chromatic number of complete multipartite hypergraphs and multiple covers by independent sets

Cites work

• Even edge colorings of a graph
• Even edge colorings of a graph

Cited in

(3)

• On decomposing a hypergraph into \(k\) connected sub-hypergraphs
• Polychromatic colorings and cover decompositions of hypergraphs
• Decomposable and indecomposable critical hypergraphs

This page was built for publication: Decomposing hypergraphs into \(k\)-colorable hypergraphs

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