Colorability of mixed hypergraphs and their chromatic inversions

DOI10.1007/S10878-012-9559-7MaRDI QIDQ1956247zbMATH OpenOpenAlexFDO

Authors Máté Hegyháti, Zsolt Tuza

Publication date 13 June 2013

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-012-9559-7

zbMATH Keywords

algorithmic complexitychromatic inversionhypergraph coloringmixed hypergraph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 5202627
• Mixed colorings of hypergraphs
• scientific article; zbMATH DE number 5202641
• Mixed hypergraphs and other coloring problems
• The chromatic spectrum of mixed hypergraphs
• scientific article; zbMATH DE number 1491631
• scientific article; zbMATH DE number 5296053
• On chromatic number of colored mixed graphs
• Coloring mixed hypergraphs: theory, algorithms and applications
• scientific article; zbMATH DE number 1439490

Cites work

• Color-bounded hypergraphs, III: model comparison
• scientific article; zbMATH DE number 3503283 (Why is no real title available?)
• scientific article; zbMATH DE number 786134 (Why is no real title available?)
• New challenges in the theory of hypergraph coloring
• On the algorithmic complexity of coloring simple hypergraphs and Steiner triple systems
• The chromatic spectrum of mixed hypergraphs
• Uncolorable mixed hypergraphs

Cited in

(3)

• Constrained colouring and \(\sigma\)-hypergraphs
• Inverse chromatic number problems in interval and permutation graphs
• Non-monochromatic non-rainbow colourings of -hypergraphs

This page was built for publication: Colorability of mixed hypergraphs and their chromatic inversions

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