Balanced graphs with minimum degree constraints

DOI10.1016/0012-365X(92)90123-WzbMath0770.05094OpenAlexW1973975855MaRDI QIDQ1193451

John Sheehan

Publication date: 27 September 1992

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

Full work available at URL: https://doi.org/10.1016/0012-365x(92)90123-w

zbMATH Keywords

partitionbalanced graphsminimum vertex degree

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (05C99)

Related Items (6)

Balanced graphs with edge density constraints ⋮ Approximation of satisfactory bisection problems ⋮ Satisfactory graph partition, variants, and generalizations ⋮ Bipartition of graph under degree constraints ⋮ Graph partitions with minimum degree constraints ⋮ Graphical decompositions

Cites Work

• Graph decomposition with constraints in the minimum degree
• Vertex colorings without isolates
• The binding number of a graph and its Anderson number

This page was built for publication: Balanced graphs with minimum degree constraints