criticality-checker
Check criticality properties of snarks
Science Score: 44.0%
This score indicates how likely this project is to be science-related based on various indicators:
-
✓CITATION.cff file
Found CITATION.cff file -
✓codemeta.json file
Found codemeta.json file -
✓.zenodo.json file
Found .zenodo.json file -
○DOI references
-
○Academic publication links
-
○Academic email domains
-
○Institutional organization owner
-
○JOSS paper metadata
-
○Scientific vocabulary similarity
Low similarity (8.9%) to scientific vocabulary
Repository
Check criticality properties of snarks
Basic Info
- Host: GitHub
- Owner: JarneRenders
- License: gpl-3.0
- Language: C
- Default Branch: main
- Size: 24.4 KB
Statistics
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
- Releases: 0
Metadata Files
README.md
CriticalityChecker
This repository contains a filter program for checking properties involving the criticality of snarks. A snark G is critical if G - {u,v} is 3-edge-colourable for every edge uv; cocritical if G - {u,v} is 3-edge-colourable for every non-adjacent pair u,v and bicritical if G - {u,v} is 3-edge-colourable for any pair u,v.
The latest version of this program can be obtained from https://github.com/JarneRenders/Criticality-Checker.
This program can be used the verify whether a snark is critical, cocritical or bicritical. These properties can also be verified for arbitrary cubic graphs. The program can also be used to determine 3-edge-colourability of the input graphs.
Installation
This requires a working shell and make. On Windows an easy way to simulate this is by using Windows Subsystem for Linux (WSL).
- Compile using:
maketo create a binary for the 64 bit versionmake 128bitto create a binary for the 128 bit versionmake 128bitarrayto create a binary for the 128 bit version which implements bitsets using arraysmake allto create all of the above
The 64 bit version is much faster than the 128 bit version, hence it is recommended to use this one when running the program on graphs with 64 vertices or fewer.
There is a difference in implementation between both of the 128 bit versions, one might be faster than the other. Both can handle input graphs up to order 128.
Use make clean to remove all binaries created using make.
Usage of CriticalityChecker
This helptext can be found by executing ./criticalityChecker -h.
Usage: ./criticalityChecker [b|c|3] [v] [h]
Filter cubic graphs satisfying certain criticality requirements. Can also be used to determine 3-edge-colourability of cubic graphs.
Graph are read from stdin in graph6 format. Graphs are sent to stdout in graph6 format. For more information on the format, see http://users.cecs.anu.edu.au/~bdm/data/formats.txt.
Without any arguments this program output graphs which are critical.
-3, --colourability
outputs graphs which are 3-edge-colourable; does not work
with -b or -c
-b, --bicritical
outputs graphs which are bicritical; does not work with
-3 or -c
-c, --cocritical
outputs graphs which are cocritical; does not work with
-3 or -b
-h, --help
outputs this helptext
-v, --verbose
sends extra information to stderr
Owner
- Name: Jarne Renders
- Login: JarneRenders
- Kind: user
- Repositories: 1
- Profile: https://github.com/JarneRenders
Citation (CITATION.cff)
cff-version: 1.2.0 message: "If you use this software, please cite it as below." authors: - family-names: "Renders" given-names: "Jarne" title: "Criticality-Checker" version: 1 date-released: 2025-04-23 url: "https://github.com/JarneRenders/Criticality-Checker"
GitHub Events
Total
- Push event: 3
- Create event: 2
Last Year
- Push event: 3
- Create event: 2