Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Journal Article
%1 journals/rsa/KardosKV12
%A Kardos, Frantisek
%A Král', Daniel
%A Volec, Jan
%D 2012
%J Random Struct. Algorithms
%K dblp
%N 4
%P 506-520
%T Maximum edge-cuts in cubic graphs with large girth and in random cubic graphs.
%U http://dblp.uni-trier.de/db/journals/rsa/rsa41.html#KardosKV12
%V 41
@article{journals/rsa/KardosKV12,
added-at = {2019-10-19T00:00:00.000+0200},
author = {Kardos, Frantisek and Král', Daniel and Volec, Jan},
biburl = {https://www.bibsonomy.org/bibtex/212c3be2e6822e8e6e70dfdab6d54327a/dblp},
ee = {https://www.wikidata.org/entity/Q57601386},
interhash = {1844637df2eb7441552d1fd25f168eca},
intrahash = {12c3be2e6822e8e6e70dfdab6d54327a},
journal = {Random Struct. Algorithms},
keywords = {dblp},
number = 4,
pages = {506-520},
timestamp = {2019-10-22T13:07:53.000+0200},
title = {Maximum edge-cuts in cubic graphs with large girth and in random cubic graphs.},
url = {http://dblp.uni-trier.de/db/journals/rsa/rsa41.html#KardosKV12},
volume = 41,
year = 2012
}