Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. Generation of Cubic ...
Article

Generation of Cubic graphs

Gunnar Brinkmann (1) (2), Jan Goedgebeur ORCID (1) (2), Brendan D. Mckay (3)
(1) Department of Applied Mathematics and Computer Science [Ghent]
(2) Department of Mathematics, Computer Science and Statistics [Ghent]
(3) Research School of Computer Science [Canberra]
Download article
Open on HAL
Imported on
January 18, 2011
Published on
July 1, 2011
Last modified on
March 31, 2025
Volume 13
vol. 13:2
Discrete Algorithms
DOI
10.46298/dmtcs.551
License
https://about.hal.science/hal-authorisation-v1
Indicators
1330
Views
4069
Downloads

Generation of Cubic graphs

Gunnar Brinkmann (1) (2), Jan Goedgebeur ORCID (1) (2), Brendan D. Mckay (3)
(1) Department of Applied Mathematics and Computer Science [Ghent]
(2) Department of Mathematics, Computer Science and Statistics [Ghent]
(3) Research School of Computer Science [Canberra]
Abstract
We describe a new algorithm for the efficient generation of all non-isomorphic connected cubic graphs. Our implementation of this algorithm is more than 4 times faster than previous generators. The generation can also be efficiently restricted to cubic graphs with girth at least 4 or 5.
Keywords
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
Cited by

Source: OpenCitations

  • Moving average network examples for asymptotically stable periodic orbits of monotone maps

    Electronic journal of qualitative theory of differential equations

    Authors : Barna Garay, Judit Várdai

    Journal reference : Volume , 2018, pp. 1-18

    DOI : 10.14232/ejqtde.2018.1.52
  • On the Smallest Snarks with Oddness 4 and Connectivity 2

    The Electronic Journal of Combinatorics

    Authors : Jan Goedgebeur ORCID

    Journal reference : Volume 25, 2018, pp.

    DOI : 10.37236/7327
  • A fuzzy graph theoretic approach to face shape recognition using cubic outerplanar structures

    Scientific Reports

    Authors : Deivanai Jaisankar ORCID, Sujatha Ramalingam ORCID, Gizachew Bayou Zegeye ORCID

    Journal reference : Volume 15, 2025, pp. 44072

    DOI : 10.1038/s41598-025-27661-y
  • Formal method for the synthesis of optimal topologies of computing systems based on the projective description of graphs

    arXiv (Cornell University)

    Authors : V. A. Melent’ev ORCID

    Journal reference : Volume 78, 2022, pp. 13915-13941

    DOI : 10.1007/s11227-022-04421-7
  • On singular signed graphs with nullspace spanned by a full vector: signed nut graphs

    Discussiones Mathematicae Graph Theory

    Authors : Nino Bašić ORCID, Patrick W. Fowler ORCID, Tomaž Pisanski ORCID, Irene Sciriha ORCID

    Journal reference : Volume 42, 2021, pp. 1351

    DOI : 10.7151/dmgt.2436
  • Xor-Magic Graphs

    Recreational mathematics magazine

    Authors : Jacob A. Siehler

    Journal reference : Volume 6, 2019, pp. 35-44

    DOI : 10.2478/rmm-2019-0004
  • Generation of Cycle Permutation Graphs and Permutation Snarks

    Lirias

    Authors : Jan Goedgebeur ORCID, Jarne Renders ORCID

    Journal reference : Volume , 2025, pp. 333-346

    DOI : 10.1007/978-3-031-82670-2_24
  • On the minimum leaf number of cubic graphs

    Discrete Mathematics

    Authors : Jan Goedgebeur ORCID, Kenta Ozeki ORCID, Nico Van Cleemput ORCID, Gábor Wiener ORCID

    Journal reference : Volume 342, 2019, pp. 3000-3005

    DOI : 10.1016/j.disc.2019.06.005
Preview
Loading PDF preview...