7 pages, 3 figures.International audienceA fullerene graph is a planar cubic 3-connected graph with only pentagonal and hexagonal faces. We show that fullerene graphs have exponentially many perfect matchings
AbstractA fullerene graph is a cubic bridgeless planar graph with twelve 5-faces such that all other...
A fullerene is a carbon molecule where each carbon atom is chemically bonded to three other carbon a...
We describe an efficient new algorithm. for the generation of fullerenes. Our implementation of this...
International audienceFullerene graphs are cubic, 3-connected, planar graphs with exactly 12 pentago...
International audienceA connected planar cubic graph is called an m-barrel fullerene and denoted by ...
The concept of importance of an edge in a fullerene graph has been defined and lower bounds have bee...
Fullerene graphs are cubic, 3-connected, planar graphs with exactly 12 pentagonal faces, while all o...
International audienceThe saturation number of a graph G is the cardinality of any smallest maximal ...
AbstractThe forcing number or the degree of freedom of a perfect matching M of a graph G is the card...
AbstractA fullerene graph is a cubic 3-connected plane graph with (exactly 12) pentagonal faces and ...
Fullerene graphs are 3-connected 3-regular planar graphs with only pentagonal and hexagonal faces. T...
A fullerene graph is a cubic bridgeless planar graph with twelve 5-faces such that all other faces a...
To the memory of Paul Erdos. Abstract. An operation on trivalent graphs leads from the truncated cub...
AbstractIt is shown that every generalized fullerene graph G with 13 pentagons is 2-extendable, a br...
AbstractFullerene graphs are 3-regular planar graphs whose faces are pentagons or hexagons. In this ...
AbstractA fullerene graph is a cubic bridgeless planar graph with twelve 5-faces such that all other...
A fullerene is a carbon molecule where each carbon atom is chemically bonded to three other carbon a...
We describe an efficient new algorithm. for the generation of fullerenes. Our implementation of this...
International audienceFullerene graphs are cubic, 3-connected, planar graphs with exactly 12 pentago...
International audienceA connected planar cubic graph is called an m-barrel fullerene and denoted by ...
The concept of importance of an edge in a fullerene graph has been defined and lower bounds have bee...
Fullerene graphs are cubic, 3-connected, planar graphs with exactly 12 pentagonal faces, while all o...
International audienceThe saturation number of a graph G is the cardinality of any smallest maximal ...
AbstractThe forcing number or the degree of freedom of a perfect matching M of a graph G is the card...
AbstractA fullerene graph is a cubic 3-connected plane graph with (exactly 12) pentagonal faces and ...
Fullerene graphs are 3-connected 3-regular planar graphs with only pentagonal and hexagonal faces. T...
A fullerene graph is a cubic bridgeless planar graph with twelve 5-faces such that all other faces a...
To the memory of Paul Erdos. Abstract. An operation on trivalent graphs leads from the truncated cub...
AbstractIt is shown that every generalized fullerene graph G with 13 pentagons is 2-extendable, a br...
AbstractFullerene graphs are 3-regular planar graphs whose faces are pentagons or hexagons. In this ...
AbstractA fullerene graph is a cubic bridgeless planar graph with twelve 5-faces such that all other...
A fullerene is a carbon molecule where each carbon atom is chemically bonded to three other carbon a...
We describe an efficient new algorithm. for the generation of fullerenes. Our implementation of this...
DOI
Add to ORKG