Partition into triangles on bounded degree graphs

DOI10.1007/978-3-642-18381-2_46MaRDI QIDQ3075543zbMATH OpenOpenAlexWikidataFDO

Authors Johan M. M. Van Rooij, Marcel E. van Kooten Niekerk, Hans L. Bodlaender

Publication date 15 February 2011

Published in SOFSEM 2011: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-18381-2_46

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Partition into triangles on bounded degree graphs
• Packing triangles in bounded degree graphs.
• Triangle-partitioning edges of planar graphs, toroidal graphs and \(k\)-planar graphs
• Packing triangles in low degree graphs and indifference graphs

Cites work

• Exact covers via determinants
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1953201 (Why is no real title available?)
• Maximum bounded 3-dimensional matching is MAX SNP-complete
• New algorithms for exact satisfiability
• Partitioning into sets of bounded cardinality
• Set partitioning via inclusion-exclusion
• The complexity of satisfiability problems
• Which problems have strongly exponential complexity?

Cited in

(7)

• Partition into triangles on bounded degree graphs
• Degree conditions for the partition of a graph into triangles and guadrilaterals
• Strong partial clones and the time complexity of SAT problems
• Data stability in clustering: a closer look
• Triangle-partitioning edges of planar graphs, toroidal graphs and \(k\)-planar graphs
• On the complexity of some quorum colorings problems of graphs
• Cluster editing with locally bounded modifications

This page was built for publication: Partition into triangles on bounded degree graphs

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