%0 Journal Article %1 journals/jda/LiskiewiczS14 %A Liskiewicz, Maciej %A Schuster, Martin R. %D 2014 %J J. Discrete Algorithms %K dblp %P 1-20 %T A new upper bound for the traveling salesman problem in cubic graphs. %U http://dblp.uni-trier.de/db/journals/jda/jda27.html#LiskiewiczS14 %V 27

@article{journals/jda/LiskiewiczS14, added-at = {2021-02-16T00:00:00.000+0100}, author = {Liskiewicz, Maciej and Schuster, Martin R.}, biburl = {https://www.bibsonomy.org/bibtex/2b0c3fd94f6478d5ac25bdb9977a16d28/dblp}, ee = {https://doi.org/10.1016/j.jda.2014.02.001}, interhash = {c64aa347e999ad4fd2a556ae1a304ef1}, intrahash = {b0c3fd94f6478d5ac25bdb9977a16d28}, journal = {J. Discrete Algorithms}, keywords = {dblp}, pages = {1-20}, timestamp = {2024-04-08T20:29:59.000+0200}, title = {A new upper bound for the traveling salesman problem in cubic graphs.}, url = {http://dblp.uni-trier.de/db/journals/jda/jda27.html#LiskiewiczS14}, volume = 27, year = 2014 }