Balanced graph partitions

DOI10.1007/S11006-006-0011-0zbMATH Open1133.05077OpenAlexW2052936935MaRDI QIDQ2473641FDOQ2473641

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

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

zbMATH Keywords

Cayley graphspanning treestar graphbalanced partitiondiameter of a graph\(r\)-critical treebalanced graph coloring

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)

Cites Work

• On the Cube of a Graph
• Kaleidoscopic graphs

Cited In (8)

• LOCALLY-BALANCED $k$-PARTITIONS OF GRAPHS
• Communication in m-connected graphs
• Title not available (Why is that?)
• Partitions of graphs by a method of independent subsets
• Independent sets and partitions of graphs
• Title not available (Why is that?)
• Generating all patterns of graph partitions within a disparity bound
• Equal distances between equal sets of vertices in 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)