scientific article
From MaRDI portal
Publication:3690214
zbMATH Open0572.68029MaRDI QIDQ3690214
Publication date: 1984
Title of this publication is not available (Why is that?)
NP-completenessthree-dimensional matching problempartition into trianglesbistable element techniquetwo-line logic technique
Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)
Related Items (8)
Some observations on holographic algorithms ⋮ On solving the queen graph coloring problem ⋮ On the complexity of cd-coloring of graphs ⋮ Title not available (Why is that?) ⋮ On the complexity of \(k\)-rainbow cycle colouring problems ⋮ The complexity of the \(T\)-coloring problem for graphs with small degree ⋮ On the complexity of the flow coloring problem ⋮ Title not available (Why is that?)
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 Q3690214)
