Meeks, K. (2016). The challenges of unbounded treewidth in parameterised subgraph counting problems. Discrete Applied Mathematics, 198, 170-194. https://doi.org/10.1016/j.dam.2015.06.019
Citácia podle Chicago (17th ed.)Meeks, Kitty. "The Challenges of Unbounded Treewidth in Parameterised Subgraph Counting Problems." Discrete Applied Mathematics 198 (2016): 170-194. https://doi.org/10.1016/j.dam.2015.06.019.
Citácia podľa MLA (8th ed.)Meeks, Kitty. "The Challenges of Unbounded Treewidth in Parameterised Subgraph Counting Problems." Discrete Applied Mathematics, vol. 198, 2016, pp. 170-194, https://doi.org/10.1016/j.dam.2015.06.019.
Upozornenie: Tieto citáce sú generované automaticky. Nemusia byť úplne správne podľa citačných pravidiel..