Add to ORKGThe concept of importance of an edge in a fullerene graph has been defined and lower bounds have been established for this quantity. These lower bounds are then used to obtain an improved lower bound on the number of perfect matchings in fullerene graphs
A fullerene is a 3-regular plane graph consisting only of pentagonal and hexagonal faces. Fullerenes...
AbstractBipartite edge frustration of a graph is defined as the smallest number of edges that have t...
Fullerenes are carbonmolecules that form polyhedral cages. Their bond structures are exactly the pla...
AbstractThe forcing number or the degree of freedom of a perfect matching M of a graph G is the card...
7 pages, 3 figures.International audienceA fullerene graph is a planar cubic 3-connected graph with ...
AbstractFullerene graphs are 3-regular planar graphs whose faces are pentagons or hexagons. In this ...
International audienceFullerene graphs are cubic, 3-connected, planar graphs with exactly 12 pentago...
International audienceThe saturation number of a graph G is the cardinality of any smallest maximal ...
Fullerene graphs are cubic, 3-connected, planar graphs with exactly 12 pentagonal faces, while all o...
International audienceA connected planar cubic graph is called an m-barrel fullerene and denoted by ...
AbstractLet G be a graph that admits a perfect matching M. A forcing set S for a perfect matching M ...
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...
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...
A fullerene is a 3-regular plane graph consisting only of pentagonal and hexagonal faces. Fullerenes...
AbstractBipartite edge frustration of a graph is defined as the smallest number of edges that have t...
Fullerenes are carbonmolecules that form polyhedral cages. Their bond structures are exactly the pla...
AbstractThe forcing number or the degree of freedom of a perfect matching M of a graph G is the card...
7 pages, 3 figures.International audienceA fullerene graph is a planar cubic 3-connected graph with ...
AbstractFullerene graphs are 3-regular planar graphs whose faces are pentagons or hexagons. In this ...
International audienceFullerene graphs are cubic, 3-connected, planar graphs with exactly 12 pentago...
International audienceThe saturation number of a graph G is the cardinality of any smallest maximal ...
Fullerene graphs are cubic, 3-connected, planar graphs with exactly 12 pentagonal faces, while all o...
International audienceA connected planar cubic graph is called an m-barrel fullerene and denoted by ...
AbstractLet G be a graph that admits a perfect matching M. A forcing set S for a perfect matching M ...
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...
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...
A fullerene is a 3-regular plane graph consisting only of pentagonal and hexagonal faces. Fullerenes...
AbstractBipartite edge frustration of a graph is defined as the smallest number of edges that have t...
Fullerenes are carbonmolecules that form polyhedral cages. Their bond structures are exactly the pla...