scientific article; zbMATH DE number 7101993

MaRDI QIDQ5233771zbMATH OpenFDO

Authors Hendrik Lüthen

Publication date 6 September 2019

Full work available at URL http://d-nb.info/1179915097/34, http://nbn-resolving.de/urn:nbn:de:tuda-tuprints-84572

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Connectivity (05C40) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) 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) Programming involving graphs or networks (90C35)

Recommendations

• Partitioning graphs into connected parts
• Partitioning Graphs into Connected Parts
• Partitioning a graph into highly connected subgraphs
• On partitioning a graph into two connected subgraphs
• On partitioning a graph into two connected subgraphs
• Partitioning a graph into two isomorphic pieces
• On the complexity of partitioning graphs into connected subgraphs
• On partitioning the edges of graphs into connected subgraphs
• scientific article; zbMATH DE number 434481

Cited in

(3)

• On the complexity of partitioning graphs into connected subgraphs
• Partitioning a graph into two pieces, each isomorphic to the other or to its complement
• On partitioning a graph into two connected subgraphs

Describes a project that uses

Uses Software

• SCIP

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 Q5233771)