scientific article; zbMATH DE number 1839477

From MaRDI portal

Revision as of 00:09, 8 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4782746

Jump to:navigation, search

zbMath1001.05110MaRDI QIDQ4782746

Daniel Král'

Publication date: 2 December 2002

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

polynomial-time algorithm mixed hypergraph hypertree

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

Mixed hypercacti ⋮ Mixed hypergraphs with bounded degree: Edge-coloring of mixed multigraphs. ⋮ Coloring mixed hypertrees

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4782746&oldid=19074446"