Skip to search formSkip to main contentSkip to account menu

Snark (graph theory)

Known as: Snark, Snark theorem 
In the mathematical field of graph theory, a snark is a simple, connected, bridgeless cubic graph with chromatic index equal to 4. In other words, it… 
Wikipedia (opens in a new tab)

Related topics

Related topics

17 relations
Bridge (graph theory)Connectivity (graph theory)Cycle double coverDaniel P. Sanders

Broader (1)

Graph coloring

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
QAP-based Simulation-Extractable SNARK with a Single Verification
. The pairing-based simulation-extractable succinct non-interactive arguments of knowledge (SE-SNARKs) are attractive since they… 
2016
2016
SURREAL: SecURe coveRt peEr communicAtion over BitTorrent protocoL
Today, peer-to-peer (p2p) networks have risen to the top echelon of information sharing on the Internet. It is a daunting task to… 
2013
2013
Snark hunting: Progressive transformative possibilities in Australia's corporate law
2013
2013
Improved bounds for the shortness coefficient of cyclically 4-edge connected cubic graphs and snarks
We present a construction which shows that there is an infinite set of cyclically 4-edge connected cubic graphs on $n$ vertices… 
2011
2011
English Access to Structured Data
We present work on using a domain model to guide text interpretation, in the context of a project that aims to interpret English… 
2003
2003
Trusting Answers on the Web
The Web lacks support for explaining information provenance. When web applications return answers, many users do not know what… 
1995
1995
Industrial Parsing of Software Manuals
  • 1995
  • Corpus ID: 265481500
of the parser in recognising the prescribed features. At various points, decisions had to be made about what counted as a given… 
1992
1992
Een jachtverbod op de snark
1990
1990
Rusia y el Snark: un viaje y un delirio
1986
1986
A declarative language: SNARK
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)