Finding d-cuts in graphs of bounded diameter, graphs of bounded radius and H-free graphs,

Lucke, Felicia; Momeni, Ali; Paulusma, Daniel; Smith, Siani

Finding d-cuts in graphs of bounded diameter, graphs of bounded radius and H-free graphs,

Lucke, Felicia; Momeni, Ali; Paulusma, Daniel; Smith, Siani

Authors

Dr Felicia Lucke felicia.c.lucke@durham.ac.uk
Postdoctoral Research Associate

Ali Momeni

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

Siani Smith

Citation

Lucke, F., Momeni, A., Paulusma, D., & Smith, S. (2024, June). Finding d-cuts in graphs of bounded diameter, graphs of bounded radius and H-free graphs,. Presented at WG, Gozd Martuljek, Slovenia

Presentation Conference Type	Conference Paper (published)
Conference Name	WG
Start Date	Jun 19, 2024
End Date	Jun 21, 2024
Acceptance Date	Apr 19, 2024
Deposit Date	Dec 31, 2024
Journal	Lecture Notes in Computer Science
Print ISSN	0302-9743
Publisher	Springer
Peer Reviewed	Peer Reviewed
Series Title	Lecture Notes in Computer Science
Series ISSN	0302-9743
Book Title	Graph-Theoretic Concepts in Computer Science
Public URL	https://durham-repository.worktribe.com/output/3229797
Publisher URL	https://link.springer.com/book/9783031754081