Matching cuts in graphs of high girth and H-free graphs

Feghali, Carl; Lucke, Felicia; Paulusma, Daniel; Ries, Bernard

doi:10.4230/LIPIcs.ISAAC.2023.31

Matching cuts in graphs of high girth and H-free graphs

Feghali, Carl; Lucke, Felicia; Paulusma, Daniel; Ries, Bernard

Authors

Carl Feghali

Felicia Lucke

Professor Daniel Paulusma daniel.paulusma@durham.ac.uk
Professor

Bernard Ries

Citation

Feghali, C., Lucke, F., Paulusma, D., & Ries, B. (2023). Matching cuts in graphs of high girth and H-free graphs. In 34th International Symposium on Algorithms and Computation (ISAAC 2023) (31:1-31:16). https://doi.org/10.4230/LIPIcs.ISAAC.2023.31

Conference Name	ISAAC 2023
Start Date	Dec 3, 2023
End Date	Dec 6, 2023
Acceptance Date	Sep 4, 2023
Online Publication Date	Nov 28, 2023
Publication Date	2023
Deposit Date	Nov 3, 2023
Publicly Available Date	Jan 16, 2024
Publisher	Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Volume	283
Pages	31:1-31:16
Series Title	Leibniz International Proceedings in Informatics
Book Title	34th International Symposium on Algorithms and Computation (ISAAC 2023)
DOI	https://doi.org/10.4230/LIPIcs.ISAAC.2023.31
Public URL	https://durham-repository.worktribe.com/output/1876008