Advanced search
1 file | 564.57 KB

Generation and properties of snarks

Author
Organization
Project
HPC-UGent: the central High Performance Computing infrastructure of Ghent University
Keywords
CYCLE-DOUBLE COVERS, Cycle double covers, Snarks, Computer generation, Shortest cycle covers, CIRCUIT DOUBLE COVERS, CUBIC GRAPHS, 4-REGULAR GRAPHS, DECOMPOSITIONS, CONJECTURE, REDUCIBILITY, MULTIGRAPHS, ODDNESS, SEARCH

Downloads

  • (...).pdf
    • full text
    • |
    • UGent only
    • |
    • PDF
    • |
    • 564.57 KB

Citation

Please use this url to cite or link to this publication:

Chicago
Brinkmann, Gunnar, Jan Goedgebeur, Jonas Hägglund, and Klas Markström. 2013. “Generation and Properties of Snarks.” Journal of Combinatorial Theory Series B 103 (4): 468–488.
APA
Brinkmann, Gunnar, Goedgebeur, J., Hägglund, J., & Markström, K. (2013). Generation and properties of snarks. JOURNAL OF COMBINATORIAL THEORY SERIES B, 103(4), 468–488.
Vancouver
1.
Brinkmann G, Goedgebeur J, Hägglund J, Markström K. Generation and properties of snarks. JOURNAL OF COMBINATORIAL THEORY SERIES B. 2013;103(4):468–88.
MLA
Brinkmann, Gunnar, Jan Goedgebeur, Jonas Hägglund, et al. “Generation and Properties of Snarks.” JOURNAL OF COMBINATORIAL THEORY SERIES B 103.4 (2013): 468–488. Print.
@article{4121087,
  author       = {Brinkmann, Gunnar and Goedgebeur, Jan and Hägglund, Jonas and Markström, Klas},
  issn         = {0095-8956},
  journal      = {JOURNAL OF COMBINATORIAL THEORY SERIES B},
  keywords     = {CYCLE-DOUBLE COVERS,Cycle double covers,Snarks,Computer generation,Shortest cycle covers,CIRCUIT DOUBLE COVERS,CUBIC GRAPHS,4-REGULAR GRAPHS,DECOMPOSITIONS,CONJECTURE,REDUCIBILITY,MULTIGRAPHS,ODDNESS,SEARCH},
  language     = {eng},
  number       = {4},
  pages        = {468--488},
  title        = {Generation and properties of snarks},
  url          = {http://dx.doi.org/10.1016/j.jctb.2013.05.001},
  volume       = {103},
  year         = {2013},
}

Altmetric
View in Altmetric
Web of Science
Times cited: