This book constitutes the refereed proceedings of the 50th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2024, held in Gozd Martuljek, Slovenia in June 2024,The 31 papers presented in this volume were carefully reviewed and selected from 89 submissions. Additionally, this volume also contains a survey on approximation algorithms for tree-width, path-width, and tree-depth prepared by Hans Bodlander, who delivered the Test of Time Award talk at WG 2024. The WG 2024 workshop aims to merge theory and practice by demonstrating how concepts from graph theory can be applied to various areas in computer science or by extracting new graph-theoretic problems from applications.

This book constitutes the refereed proceedings of the 50th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2024, held in Gozd Martuljek, Slovenia in June 2024,The 31 papers presented in this volume were carefully reviewed and selected from 89 submissions. Additionally, this volume also contains a survey on approximation algorithms for tree-width, path-width, and tree-depth prepared by Hans Bodlander, who delivered the Test of Time Award talk at WG 2024. The WG 2024 workshop aims to merge theory and practice by demonstrating how concepts from graph theory can be applied to various areas in computer science or by extracting new graph-theoretic problems from applications.

This book constitutes the refereed proceedings of the 50th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2024, held in Gozd Martuljek, Slovenia in June 2024,The 31 papers presented in this volume were carefully reviewed and selected from 89 submissions. Additionally, this volume also contains a survey on approximation algorithms for tree-width, path-width, and tree-depth prepared by Hans Bodlander, who delivered the Test of Time Award talk at WG 2024. The WG 2024 workshop aims to merge theory and practice by demonstrating how concepts from graph theory can be applied to various areas in computer science or by extracting new graph-theoretic problems from applications.