scientific article; zbMATH DE number 1834670

zbMATH Open1001.05055MaRDI QIDQ4779166FDOQ4779166

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

Publication date: 25 November 2002

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

Title of this publication is not available (Why is that?)

Recommendations

• Mixed hypergraphs with bounded degree: Edge-coloring of mixed multigraphs.
• On feasible sets of mixed hypergraphs
• Uncolorable mixed hypergraphs
• Coloring mixed hypertrees
• scientific article; zbMATH DE number 1839477

zbMATH Keywords

chromatic numberpolynomial-time algorithmsvertex coloringfeasible set

Mathematics Subject Classification ID

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

Cited In (9)

• On the upper chromatic number of \((v_3,b_2)\)-configurations
• Orderings of uniquely colorable hypergraphs
• Title not available (Why is that?)
• Mixed hypergraphs with bounded degree: Edge-coloring of mixed multigraphs.
• Mixed hypergraphs and beyond
• On feasible sets of mixed hypergraphs
• Uncolorable mixed hypergraphs
• Mixed hypercacti
• Coloring mixed hypertrees

This page was built for publication:

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