Skip to main
Zenodo home
Communities
My dashboard
Log in Sign up
Published March 3, 2021 | Version 2
Journal article Open

irreducibles

Authors/Creators

  • James Cruickshank
  • Qays Shakir

Description

SageMaths 8.1 code for identifying irreducible (2,2)-tight torus graphs. Complete description of all 116 irreducibles

Files

irreducibles-2.zip

Files (1.4 MB)

Name Size Download all
irreducibles-2.zip
md5:5502f62f6d79cc0314a3ee630032aba0
1.4 MB Preview Download
219
Views
57
Downloads
Show more details
All versions This version
Views

Total views

219 219
Downloads

Total downloads

57 57
Data volume

Total data volume

79.7 MB 79.7 MB

More info on how stats are collected....

Versions

External resources

Indexed in
  • OpenAIRE

Communities

Details

DOI
10.5281/zenodo.4579832
DOI Badge

DOI

10.5281/zenodo.4579832

Markdown

[![DOI](https://zenodo.org/badge/DOI/10.5281/zenodo.4579832.svg)](https://doi.org/10.5281/zenodo.4579832)

reStructuredText

.. image:: https://zenodo.org/badge/DOI/10.5281/zenodo.4579832.svg
  :target: https://doi.org/10.5281/zenodo.4579832

HTML

<a href="https://doi.org/10.5281/zenodo.4579832"><img src="https://zenodo.org/badge/DOI/10.5281/zenodo.4579832.svg" alt="DOI"></a>

Image URL

https://zenodo.org/badge/DOI/10.5281/zenodo.4579832.svg

Target URL

https://doi.org/10.5281/zenodo.4579832
Resource type
Journal article
Publisher
Zenodo

Rights

License
cc-by-4.0 icon Creative Commons Attribution 4.0 International
The Creative Commons Attribution license allows re-distribution and re-use of a licensed work on the condition that the creator is appropriately credited. Read more

Citation

Export

Technical metadata

Created
March 3, 2021
Modified
March 4, 2021

About

  • About
  • Policies
  • Infrastructure
  • Principles
  • Projects
  • Roadmap
  • Contact

Blog

  • Blog

Support

  • Help
  • FAQ

Developers

  • REST API
  • OAI-PMH

Contribute

  • GitHub
  • Donate

Funded by

Powered by CERN Data Centre & InvenioRDM

  • Status
  • Privacy policy
  • Cookie policy
  • Terms of Use

This site uses cookies. Find out more on how we use cookies