Finding <i>d</i>-cuts in graphs of bounded diameter, graphs of bounded radius and <i>H</i>-free graphs

The d-CUT problem is to decide whether a graph has an edge cut such that each vertex has at most d neighbours on the opposite side of the cut. If d=1, we obtain the intensively studied MATCHING CUT problem. The d-CUT problem has been studied as well, but a systematic study for special graph classes...

Full description

Saved in:
Bibliographic Details
Main Authors: Felicia Lucke, Ali Momeni, Daniël Paulusma, Siani Smith
Format: Default Article
Published: 2025
Subjects:
Matching cut
D-cut
Diameter
Radius
H-free graph
Online Access:https://hdl.handle.net/2134/31017631.v1
Tags: Add Tag
No Tags, Be the first to tag this record!

Similar Items