Примеры использования Snark на Английском языке и их переводы на Русский язык
{-}
-
Colloquial
-
Official
The Snark is a peculiar.
The Hunting Of The Snark.
And Michael, snark central.
You know The Hunting Of The Snark.
I read the Snark last night.
Why don't you just explain the Snark?
The snark is uncalled for, Your Honor.
Back, cry, forget, snark, fight.
The Watkins snark is also non-planar and non-hamiltonian.
Hey, what's up with the snark sisters?
The first known snark was the Petersen graph, discovered in 1898.
I already know the answer to this, butdo they ever find the Snark?
A Descartes snark is an undirected graph with 210 vertices and 315 edges.
In 1973, George Szekeres found the fifth known snark- the Szekeres snark.
The double-star snark is non-planar and non-hamiltonian but is hypohamiltonian.
Tilde mark, inverted exclamation mark, snark, ironieteken, SarcMark etc.
The name flower snark is sometimes used for J5, a flower snark with 20 vertices and 30 edges.
As a connected bridgeless cubic graph with chromatic index four,the Petersen graph is a snark.
Tutte conjectured that every snark has the Petersen graph as a minor.
The snark is a fictional animal species created by Lewis Carroll in his nonsense poem The Hunting of the Snark. .
Five miles offshore today on the Snark Ark'cause I'm not going onshore.
It is a snark, first discovered by William Tutte in 1948 under the pseudonym Blanche Descartes.
You placed a bid for the Snark manuscript to goad your brother.
A Descartes snark is obtained from the Petersen graph by replacing each vertex with a nonagon and each edge with a particular graph closely related to the Petersen graph.
However, if you are labouring under the assumption that Mr Hawes died because of the Snark, I'm afraid you're greatly mistaken.
Another well known snark on 50 vertices is the Watkins snark discovered by John J. Watkins in 1989.
Let's just suppose that Murray was getting close to a solution to the Snark and Conor has to try and block him.
The second Loupekine snark is obtained(up to an isomorphism) by replacing edges 5-6 and 11-12 by edges 5-12 and 6-11 in the first graph.
Tietze's graph matches part of the definition of a snark: it is a cubic bridgeless graph that is not 3-edge-colorable.
Every hypohamiltonian snark is bicritical: removing any two vertices leaves a subgraph the edges of which can be colored with only three colors.