A note on k-partitions of graphs

MaRDI QIDQ3179837zbMATH OpenFDO

Authors Muhuo Liu, Baogang Xu

Publication date 6 January 2017

zbMATH Keywords

boundpartition of graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Recommendations

• Better bounds for \(k\)-partitions of graphs
• On judicious partitions of graphs
• Graph partitions. II
• Bounds for pairs in partitions of graphs
• A bound for judicious \(k\)-partitions of graphs

Cited in

(11)

• On Bounds for the k-Partitioning of Graphs
• Better bounds for \(k\)-partitions of graphs
• On \(k\)-partite subgraphs
• scientific article; zbMATH DE number 3957131 (Why is no real title available?)
• On a graph partition result of Kűhn and Osthus.
• scientific article; zbMATH DE number 1792660 (Why is no real title available?)
• A note on non-dominating set partitions in graphs
• scientific article; zbMATH DE number 1536521 (Why is no real title available?)
• Biased partitions and judicious \(k\)-partitions of graphs
• A note on formulations for the \(A\)-partition problem on hypergraphs
• On the \(k\)-partition dimension of graphs

This page was built for publication: A note on \(k\)-partitions of graphs

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