A note on k-partitions of graphs

zbMATH Open1363.05201MaRDI QIDQ3179837FDOQ3179837

Baogang Xu, Muhuo Liu

Publication date: 6 January 2017

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

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)

Cited In (9)

• On Bounds for the k-Partitioning of Graphs
• A note on formulations for the \(A\)-partition problem on hypergraphs
• On \(k\)-partite subgraphs
• Biased partitions and judicious \(k\)-partitions of graphs
• Title not available (Why is that?)
• A note on non-dominating set partitions in graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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)