Results 261 to 270 of about 15,334 (300)
Some of the next articles are maybe not open access.
Ukrainian Mathematical Journal, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Ars Comb., 1998
A snark is a simple, cyclically 4-edge connected cubic graph with girth at least 5 and chromatic index 4. A cubic graph \(G\) is vertex-reducible to a simple cubic graph \(G'\) if \(G'\) can be obtained from \(G\) by removing two vertices together with all incident edges from \(G\) and adding new edges to obtain \(G'\).
Gunnar Brinkmann, Eckhard Steffen
openaire +2 more sources
A snark is a simple, cyclically 4-edge connected cubic graph with girth at least 5 and chromatic index 4. A cubic graph \(G\) is vertex-reducible to a simple cubic graph \(G'\) if \(G'\) can be obtained from \(G\) by removing two vertices together with all incident edges from \(G\) and adding new edges to obtain \(G'\).
Gunnar Brinkmann, Eckhard Steffen
openaire +2 more sources
To Reduce or Not to Reduce (Continued)
The American Journal of Nursing, 1925openaire +1 more source