On a graph partition result of Kűhn and Osthus.

zbMATH Open1265.05492MaRDI QIDQ4897503FDOQ4897503

Authors: Rui Li, Baogang Xu 

Publication date: 19 December 2012

Recommendations

• Partitioning a graph into highly connected subgraphs
• On judicious partitions of graphs
• A note on \(k\)-partitions of graphs
• Graph partitions. II
• Better bounds for \(k\)-partitions of graphs

zbMATH Keywords

graph partitionminimum degreeinduced subgraph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited In (1)

• The efficient partition surplus Owen graph value

This page was built for publication: On a graph partition result of Kűhn and Osthus.

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