APA (7th ed.) Citation

Bok, J., Fiala, J., Jedličková, N., Kratochvíl, J., Seifrtová, M., Goos, G., . . . Ries, B. (2023). Computational Complexity of Covering Colored Mixed Multigraphs with Degree Partition Equivalence Classes of Size at Most Two (Extended Abstract). Graph-Theoretic Concepts in Computer Science : 49th International Workshop, WG 2023, Fribourg, Switzerland, June 28–30, 2023, Revised Selected Papers, 14093, 101-115. https://doi.org/10.1007/978-3-031-43380-1_8

Chicago Style (17th ed.) Citation

Bok, Jan, et al. "Computational Complexity of Covering Colored Mixed Multigraphs with Degree Partition Equivalence Classes of Size at Most Two (Extended Abstract)." Graph-Theoretic Concepts in Computer Science : 49th International Workshop, WG 2023, Fribourg, Switzerland, June 28–30, 2023, Revised Selected Papers 14093 (2023): 101-115. https://doi.org/10.1007/978-3-031-43380-1_8.

MLA (9th ed.) Citation

Bok, Jan, et al. "Computational Complexity of Covering Colored Mixed Multigraphs with Degree Partition Equivalence Classes of Size at Most Two (Extended Abstract)." Graph-Theoretic Concepts in Computer Science : 49th International Workshop, WG 2023, Fribourg, Switzerland, June 28–30, 2023, Revised Selected Papers, vol. 14093, 2023, pp. 101-115, https://doi.org/10.1007/978-3-031-43380-1_8.