default author photo

Van Bang Le

University of Rostock

Postfach 10 08 88

Rostock, 18055

Germany

  • University of Rostock

SCHOLARLY PAPERS

1

DOWNLOADS

36

TOTAL CITATIONS

2

Scholarly Papers (1)

Actions:
Email selected abstracts
1.

Complexity and Algorithms for Matching Cut Problems in Graphs Without Long Induced Paths and Cycles 1

Number of pages: 28 Posted: 10 Apr 2024
Van Bang Le and Hoang-Oanh Le
University of Rostock and Independent
Downloads 36 (1,249,711)
Citation 2

Abstract:

Loading...

Matching cut, Perfect matching cut, Disconnected perfect matching, H-free graph, k-chordal graph, Computational complexity, Promise problem