Goedgebeur, J., Huang, S., Ju, Y., & Merkel, O. (2023). Colouring graphs with no induced six-vertex path or diamond. Theoretical computer science, 941, 278-299. https://doi.org/10.1016/j.tcs.2022.11.020
Citace podle Chicago (17th ed.)Goedgebeur, Jan, Shenwei Huang, Yiao Ju, a Owen Merkel. "Colouring Graphs with No Induced Six-vertex Path or Diamond." Theoretical Computer Science 941 (2023): 278-299. https://doi.org/10.1016/j.tcs.2022.11.020.
Citace podle MLA (9th ed.)Goedgebeur, Jan, et al. "Colouring Graphs with No Induced Six-vertex Path or Diamond." Theoretical Computer Science, vol. 941, 2023, pp. 278-299, https://doi.org/10.1016/j.tcs.2022.11.020.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..