Graph partitions with minimum degree constraints

DOI10.1016/S0012-365X(98)00114-9zbMath0955.05102OpenAlexW1967830561MaRDI QIDQ1584392

Esther M. Arkin, Refael Hassin

Publication date: 2 November 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(98)00114-9

zbMATH Keywords

partitionpolynomial time algorithm

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

Approximation of satisfactory bisection problems ⋮ Satisfactory graph partition, variants, and generalizations ⋮ Bipartition of graph under degree constraints ⋮ A NOTE ON ALMOST BALANCED BIPARTITIONS OF A GRAPH

Cites Work

• Unnamed Item
• Unnamed Item
• Graph decomposition with constraints in the minimum degree
• Balanced graphs with minimum degree constraints
• Vertex colorings without isolates
• Graphical decompositions

This page was built for publication: Graph partitions with minimum degree constraints