Add to ORKGWe determine the full automorphism group of each member of threeinfinite families of connected cubic graphs which are snarks. A graph issaid to be nearly hamiltonian if it has a cycle which contains all verticesbut one. We prove, in particular, that for every possible order n > 28 thereexists a nearly hamiltonian snark of order n with trivial automorphismgroup
A graph G is hypohamiltonian if it is not Hamiltonian but for each v∈V(G)v∈V(G), the graph G−vG−v is...
A snark is a non-trivial cubic graph admitting no Tait coloring. We examine the structure of the two...
We study snarks whose edges cannot be covered by fewer than five perfect matchings. Esperet and Mazz...
We determine the full automorphism group of each member of threeinfinite families of connected cubic...
We determine the full automorphism group of each member of three infinite families of connected cubi...
In this paper we survey recent results and problems of both theoretical and algorithmic character on...
For a number of unsolved problems in graph theory such as the cycle double cover conjecture, Fulkers...
AbstractSnarks are cyclically 4-edge-connected cubic graphs with girth at least 5 and with no 3-edge...
We report the most relevant results on the classification, up to isomorphism, of nontrivial simple u...
AbstractA snark is a “nontrivial” cubic graph whose edges cannot be properly coloured by three colou...
Abstract. For many of the unsolved problems concerning cycles and matchings in graphs it is known th...
Flower snarks and Goldberg snarks are two infinite families of cyclically 5-edge-connected cubic gra...
Abstract. In this note we construct two infinite snark families which have high oddness and low circ...
V článku studujeme grafy typu snark, jejichž hrany se nedají pokrýt méně než 5 perfektními párováním...
A graph G is almost hypohamiltonian (a.h.) if G is non-hamiltonian, there exists a vertex w in G suc...
A graph G is hypohamiltonian if it is not Hamiltonian but for each v∈V(G)v∈V(G), the graph G−vG−v is...
A snark is a non-trivial cubic graph admitting no Tait coloring. We examine the structure of the two...
We study snarks whose edges cannot be covered by fewer than five perfect matchings. Esperet and Mazz...
We determine the full automorphism group of each member of threeinfinite families of connected cubic...
We determine the full automorphism group of each member of three infinite families of connected cubi...
In this paper we survey recent results and problems of both theoretical and algorithmic character on...
For a number of unsolved problems in graph theory such as the cycle double cover conjecture, Fulkers...
AbstractSnarks are cyclically 4-edge-connected cubic graphs with girth at least 5 and with no 3-edge...
We report the most relevant results on the classification, up to isomorphism, of nontrivial simple u...
AbstractA snark is a “nontrivial” cubic graph whose edges cannot be properly coloured by three colou...
Abstract. For many of the unsolved problems concerning cycles and matchings in graphs it is known th...
Flower snarks and Goldberg snarks are two infinite families of cyclically 5-edge-connected cubic gra...
Abstract. In this note we construct two infinite snark families which have high oddness and low circ...
V článku studujeme grafy typu snark, jejichž hrany se nedají pokrýt méně než 5 perfektními párováním...
A graph G is almost hypohamiltonian (a.h.) if G is non-hamiltonian, there exists a vertex w in G suc...
A graph G is hypohamiltonian if it is not Hamiltonian but for each v∈V(G)v∈V(G), the graph G−vG−v is...
A snark is a non-trivial cubic graph admitting no Tait coloring. We examine the structure of the two...
We study snarks whose edges cannot be covered by fewer than five perfect matchings. Esperet and Mazz...