Generation of Cubic graphs

@article{Brinkmann2011GenerationOC,
  title={Generation of Cubic graphs},
  author={Gunnar Brinkmann and Jan Goedgebeur and Brendan D. McKay},
  journal={Discrete Mathematics & Theoretical Computer Science},
  year={2011},
  volume={13},
  pages={69-80}
}
Cubic or 3-regular graphs are (simple) graphs where each vertex has degree 3. The class of cubic graphs is especially interesting for mathematical applications because for various important open problems in graph theory cubic graphs are the smallest or simplest possible potential counterexamples. In chemistry, cubic graphs serve as models for the Nobel Prize winning fullerenes [14] or, more generally, for some cyclopolyenes [2]. The generation of cubic graphs can be considered a benchmark… CONTINUE READING
18 Citations
23 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 23 references

Algorithms for generation of cubic graphs

  • S. Sanjmyatav
  • Master’s thesis, Australian National University
  • 2000
Highly Influential
3 Excerpts

Constructing the cubic graphs on up to 20 vertices

  • B. D. McKay, G. F. Royle
  • Ars Combinatoria, 21a:129–140
  • 1986
1 Excerpt

Similar Papers

Loading similar papers…