The Complexity of Diameter on H-free Graphs

Oostveen, Jelle J.; Paulusma, Daniel; van Leeuwen, Erik Jan

doi:10.1007/978-3-031-75409-8_31

The Complexity of Diameter on H-free Graphs

Oostveen, Jelle J.; Paulusma, Daniel; van Leeuwen, Erik Jan

Authors

Jelle J. Oostveen

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

Erik Jan van Leeuwen

Citation

Oostveen, J. J., Paulusma, D., & van Leeuwen, E. J. (2024, June). The Complexity of Diameter on H-free Graphs. Presented at WG 2024, Gozd Martuljek, Slovenia

Presentation Conference Type	Conference Paper (published)
Conference Name	WG 2024
Start Date	Jun 19, 2024
End Date	Jun 21, 2024
Acceptance Date	Apr 19, 2024
Online Publication Date	Jan 22, 2025
Publication Date	Jan 22, 2025
Deposit Date	Dec 31, 2024
Publicly Available Date	Feb 12, 2025
Print ISSN	0302-9743
Publisher	Springer
Peer Reviewed	Peer Reviewed
Pages	444-459
Series Title	Lecture Notes in Computer Science
Series ISSN	0302-9743
Book Title	Graph-Theoretic Concepts in Computer Science
ISBN	9783031754081
DOI	https://doi.org/10.1007/978-3-031-75409-8_31
Public URL	https://durham-repository.worktribe.com/output/3230217