Bonomo, F., Schaudt, O., Stein, M., & Valencia-Pabon, M. (2014, January 10). b-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs. arXiv.org. https://doi.org/10.48550/arxiv.1310.8313
Citace podle Chicago (17th ed.)Bonomo, Flavia, Oliver Schaudt, Maya Stein, a Mario Valencia-Pabon. "B-coloring Is NP-hard on Co-bipartite Graphs and Polytime Solvable on Tree-cographs." ArXiv.org 10 Jan. 2014. https://doi.org/10.48550/arxiv.1310.8313.
Citace podle MLA (9th ed.)Bonomo, Flavia, et al. "B-coloring Is NP-hard on Co-bipartite Graphs and Polytime Solvable on Tree-cographs." ArXiv.org, 10 Jan. 2014, https://doi.org/10.48550/arxiv.1310.8313.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..