Matching Cut and Variants on Bipartite Graphs of Bounded Radius and Diameter

Documenti analoghi

• Dichotomies for Maximum Matching Cut: $H$-Freeness, Bounded Diameter, Bounded Radius
  di: Lucke, Felicia, et al.
  Pubblicazione: (2023)
• Finding d-Cuts in Graphs of Bounded Diameter, Graphs of Bounded Radius and H-Free Graphs
  di: Lucke, Felicia, et al.
  Pubblicazione: (2024)
• Finding Minimum Matching Cuts in $H$-free Graphs
  di: Lucke, Felicia, et al.
  Pubblicazione: (2025)
• Finding d-Cuts in Claw-free Graphs
  di: Ahn, Jungho, et al.
  Pubblicazione: (2025)
• Colouring Graphs Without a Subdivided H-Graph: A Full Complexity Classification
  di: Eagling-Vose, Tala, et al.
  Pubblicazione: (2025)