Complexity note on mixed hypergraphs

DOI10.1007/3-540-44683-4_42MaRDI QIDQ4779166zbMATH OpenFDO

Authors Jan Kratochvíl, Daniel Král', Heinz-Juergen Voss

Publication date 25 November 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2136/21360474

zbMATH Keywords

chromatic numberfeasible setpolynomial-time algorithmsvertex coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Mixed hypergraphs with bounded degree: Edge-coloring of mixed multigraphs.
• On feasible sets of mixed hypergraphs
• Uncolorable mixed hypergraphs
• Coloring mixed hypertrees
• On complexity of colouring mixed hypertrees

Cited in

(9)

• Mixed hypergraphs with bounded degree: Edge-coloring of mixed multigraphs.
• On the upper chromatic number of (v₃,b₂)-configurations
• Mixed hypercacti
• On feasible sets of mixed hypergraphs
• Uncolorable mixed hypergraphs
• Coloring mixed hypertrees
• On complexity of colouring mixed hypertrees
• Mixed hypergraphs and beyond
• Orderings of uniquely colorable hypergraphs

This page was built for publication: Complexity note on mixed hypergraphs

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