Add to ORKGWe describe a new algorithm for the efficient generation of all non-isomorphic connected cubic graphs. Our implementation of this algorithm is more than 4 times faster than previous generators. The generation can also be efficiently restricted to cubic graphs with girth at least 4 or 5
The construction of complete lists of regular graphs up to isomorphism is one of the oldest problems...
We present a polynomial-time 9/7-approximation algorithm for the graphic TSP for cubic graphs, which...
AbstractIn this article, we describe a method of constructing all simple triangulations of the spher...
We describe a new algorithm for the efficient generation of all non-isomorphic connected cubic graph...
In this paper an easy programmable, but nevertheless very efficient method to generate regular graph...
A cubic graph is a simple graph in which each vertex is adjacent to three other vertices. Cubic grap...
It turns out that there exist numerous useful classes of cubic graphs. Some are needed in connection...
A cubic graph is a simple graph in which each vertex is adjacent to three other vertices. Cu-bic gra...
This paper is concerned with the subclass of graphs called cubic graphs. We survey these graphs and ...
AbstractClaw-free cubic graphs are counted with given connectedness and order. Tables are provided f...
AbstractThe aim of the present note is the announcement of the results of our “Computer investigatio...
AbstractWe prove that the following problem is NP-complete: Given a cubic graphGand a natural number...
The goal of this thesis is to study two related problems that, in the broadest terms, lie in a branc...
AbstractWe present a construction for cubic graphs related to the well-known Cayley graphs and use i...
In this thesis, efficient isomorph-free generation of graph classes with the method of generation b...
The construction of complete lists of regular graphs up to isomorphism is one of the oldest problems...
We present a polynomial-time 9/7-approximation algorithm for the graphic TSP for cubic graphs, which...
AbstractIn this article, we describe a method of constructing all simple triangulations of the spher...
We describe a new algorithm for the efficient generation of all non-isomorphic connected cubic graph...
In this paper an easy programmable, but nevertheless very efficient method to generate regular graph...
A cubic graph is a simple graph in which each vertex is adjacent to three other vertices. Cubic grap...
It turns out that there exist numerous useful classes of cubic graphs. Some are needed in connection...
A cubic graph is a simple graph in which each vertex is adjacent to three other vertices. Cu-bic gra...
This paper is concerned with the subclass of graphs called cubic graphs. We survey these graphs and ...
AbstractClaw-free cubic graphs are counted with given connectedness and order. Tables are provided f...
AbstractThe aim of the present note is the announcement of the results of our “Computer investigatio...
AbstractWe prove that the following problem is NP-complete: Given a cubic graphGand a natural number...
The goal of this thesis is to study two related problems that, in the broadest terms, lie in a branc...
AbstractWe present a construction for cubic graphs related to the well-known Cayley graphs and use i...
In this thesis, efficient isomorph-free generation of graph classes with the method of generation b...
The construction of complete lists of regular graphs up to isomorphism is one of the oldest problems...
We present a polynomial-time 9/7-approximation algorithm for the graphic TSP for cubic graphs, which...
AbstractIn this article, we describe a method of constructing all simple triangulations of the spher...