Balanced graphs with edge density constraints

DOI10.1002/JGT.3190140607MaRDI QIDQ3970898zbMATH OpenOpenAlexFDO

Authors J. Sheehan

Publication date 25 June 1992

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.3190140607

zbMATH Keywords

balanced graphsbalanced partitionedge density

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Balanced graphs with minimum degree constraints
• A note on balanced bipartitions
• Bounds for judicious balanced bipartitions of graphs
• Balanced judicious bipartitions of graphs

Cites work

• Balanced graphs with minimum degree constraints

Cited in

(16)

• Perfectly balanced partitions of smoothed graphs
• Graphes équilibrés et arboricité rationnelle. (Balanced graphs and rational arboricity)
• Balanced graphs with minimum degree constraints
• Graphical decompositions
• Balanced graph partitions
• Bipartition of graph under degree constraints
• Bipartite graphs with balanced (a,b)-partitions
• Maximum balanced 3-partitions of graphs
• scientific article; zbMATH DE number 4139799 (Why is no real title available?)
• Every graph is contained in a sparsest possible balanced graph
• scientific article; zbMATH DE number 3970800 (Why is no real title available?)
• scientific article; zbMATH DE number 29852 (Why is no real title available?)
• scientific article; zbMATH DE number 54793 (Why is no real title available?)
• scientific article; zbMATH DE number 2058980 (Why is no real title available?)
• Balanced and 1-balanced graph constructions
• Independent sets and partitions of graphs

This page was built for publication: Balanced graphs with edge density constraints

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