Balanced graph partitions

DOI10.1007/S11006-006-0011-0MaRDI QIDQ2473641zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 4 March 2008

Published in Mathematical Notes (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11006-006-0011-0

zbMATH Keywords

\(r\)-critical treebalanced graph coloringbalanced partitionCayley graphdiameter of a graphspanning treestar graph

Mathematics Subject Classification ID

Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• scientific article; zbMATH DE number 2058980
• Maximum balanced 3-partitions of graphs
• Some results of regular graphs on the existence of balanced partition
• Balanced graphs with edge density constraints
• Judicious partitions of graphs

Cites work

• Kaleidoscopic graphs
• On the Cube of a Graph

Cited in

(8)

• Communication in m-connected graphs
• Generating all patterns of graph partitions within a disparity bound
• Partitions of graphs by a method of independent subsets
• scientific article; zbMATH DE number 6501194 (Why is no real title available?)
• scientific article; zbMATH DE number 2058980 (Why is no real title available?)
• LOCALLY-BALANCED k-PARTITIONS OF GRAPHS
• Equal distances between equal sets of vertices in graphs
• Independent sets and partitions of graphs

This page was built for publication: Balanced graph partitions

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