Colorability of mixed hypergraphs and their chromatic inversions
type: Item
instance of: scholarly article
title: Colorability of mixed hypergraphs and their chromatic inversions
zbMATH Open document ID: 1271.05070
author: Máté Hegyháti
author: Zsolt Tuza
published in: Journal of Combinatorial Optimization
publication date: 2013-06-13T00:00:00Z
Mathematics Subject Classification ID: 05C65
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 6175238
zbMATH Keywords: hypergraph coloring
zbMATH Keywords: algorithmic complexity
zbMATH Keywords: mixed hypergraph
zbMATH Keywords: chromatic inversion
MaRDI profile type: Publication
full work available at URL: s10878-012-9559-7
OpenAlex ID: W2031033190
cites work: Q3012388
cites work: Uncolorable mixed hypergraphs
cites work: Q3649378
cites work: The chromatic spectrum of mixed hypergraphs
cites work: Q4083461
cites work: On the algorithmic complexity of coloring simple hypergraphs and Steiner triple systems
cites work: Q4842710
DOI: 10.1007/S10878-012-9559-7
Recommended article: Q5421117
Recommended article: Mixed colorings of hypergraphs
Recommended article: Q5421131
Recommended article: Mixed hypergraphs and other coloring problems
Recommended article: The chromatic spectrum of mixed hypergraphs
Recommended article: Q4498323
Recommended article: Q3509409
Recommended article: On Chromatic Number of Colored Mixed Graphs
Recommended article: Coloring mixed hypergraphs: theory, algorithms and applications
Recommended article: Q4949869
description: scientific article; zbMATH DE number 6175238