Graph partitions with minimum degree constraints

DOI10.1016/S0012-365X(98)00114-9MaRDI QIDQ1584392zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Degree-constrained 2-partitions of graphs
• On partitions of graphs under degree constraints
• Bipartition of graph under degree constraints
• Balanced graphs with minimum degree constraints
• Partitions of graphs and multigraphs under degree constraints

Cites work

• scientific article; zbMATH DE number 3652373 (Why is no real title available?)
• scientific article; zbMATH DE number 3243267 (Why is no real title available?)
• Balanced graphs with minimum degree constraints
• Graph decomposition with constraints in the minimum degree
• Graphical decompositions
• Vertex colorings without isolates

Cited in

(19)

• Minimum degree conditions for monochromatic cycle partitioning
• Approximation of satisfactory bisection problems
• A note on almost balanced bipartitions of a graph
• Partitioning graphs with linear minimum degree
• Minimum nonuniform graph partitioning with unrelated weights
• Bipartition of graph under degree constraints
• On partitions of graphs under degree constraints
• Partitioning a graph into minimum gap components
• scientific article; zbMATH DE number 867650 (Why is no real title available?)
• scientific article; zbMATH DE number 4014756 (Why is no real title available?)
• Conditions for graphs to be path partition optimal
• Satisfactory graph partition, variants, and generalizations
• Balanced graphs with minimum degree constraints
• On minimal arbitrarily partitionable graphs
• Constrained Min-Cut Replication for K-Way Hypergraph Partitioning
• Minimum degree thresholds for bipartite graph tiling
• A minimal surface criterion for graph partitioning
• Min-Max Graph Partitioning and Small Set Expansion
• Minimization and parameterized variants of vertex partition problems on graphs

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

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