scientific article; zbMATH DE number 3913673

MaRDI QIDQ3690214zbMATH OpenFDO

Authors Kohei Noshita

Publication date 1984

zbMATH Keywords

bistable element techniqueNP-completenesspartition into trianglesthree-dimensional matching problemtwo-line logic technique

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 4008418
• On the complexity of H-coloring
• On the NP-completeness of the \(k\)-colorability problem for triangle-free graphs
• On the complexity for constructing a 3-colouring for planar graphs with short facets
• The complexity of some problems related to GRAPH 3-COLORABILITY

Cited in

(10)

• The complexity of the \(T\)-coloring problem for graphs with small degree
• Some observations on holographic algorithms
• On solving the queen graph coloring problem
• On the complexity of cd-coloring of graphs
• On the complexity of \(k\)-rainbow cycle colouring problems
• scientific article; zbMATH DE number 4024813 (Why is no real title available?)
• An Average Case NP-complete Graph Colouring Problem
• On the complexity of the flow coloring problem
• scientific article; zbMATH DE number 4187829 (Why is no real title available?)
• scientific article; zbMATH DE number 7589530 (Why is no real title available?)

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)