AbstractThe resonance graph of a benzenoid graph G has the 1-factors of G as vertices, two 1-factors being adjacent if their symmetric difference forms the edge set of a hexagon of G. It is proved that the smallest number of elementary cuts that cover a catacondensed benzenoid graph equals the dimension of a largest induced hypercube of its resonance graph
The Fibonacci dimension ▫$text{fdim}(G)$▫ of a graph ▫$G$▫ was introduced [in S. Cabello, D. Eppstei...
A benzenoid graph is a finite connected plane graph with no cut vertices in which every interior reg...
As a general case of molecular graphs of benzenoid hydrocarbons, we study plane bipartite graphs wit...
The resonance graph of a benzenoid graph G has the 1-factors of G as vertices, two 1-factors being a...
AbstractThe resonance graph R(B) of a benzenoid graph B has the perfect matchings of B as vertices, ...
AbstractLet G be a planar embedded 2-connected graph. Then the vertices of its resonance graph R(G) ...
Let G be a planar embedded 2-connected graph. Then the vertices of its resonance graph R(G) are the ...
In August 2003 the computer program GRAFFITI made conjecture 1001 stating that for any benzenoid gra...
benzenoid graph, the size of a maximum matching equals the number of positive eigenvalues. Later, th...
AbstractA benzenoid graph is a finite connected plane graph with no cut vertices in which every inte...
AbstractThe phenomenon of resonance amongst a set of different classical chemical structures entails...
The resonance graph R(B) of a benzenoid graph B has the perfect matchings of B as vertices, two perf...
AbstractIt is shown that the number of Clar formulas of a Kekuléan benzenoid system B is equal to th...
AbstractWe consider a partitioning problem, defined for bipartite and 2-connected plane graphs, wher...
The paper presents the results referring to the k-dominating numbers on the linear benzenoid chain (...
The Fibonacci dimension ▫$text{fdim}(G)$▫ of a graph ▫$G$▫ was introduced [in S. Cabello, D. Eppstei...
A benzenoid graph is a finite connected plane graph with no cut vertices in which every interior reg...
As a general case of molecular graphs of benzenoid hydrocarbons, we study plane bipartite graphs wit...
The resonance graph of a benzenoid graph G has the 1-factors of G as vertices, two 1-factors being a...
AbstractThe resonance graph R(B) of a benzenoid graph B has the perfect matchings of B as vertices, ...
AbstractLet G be a planar embedded 2-connected graph. Then the vertices of its resonance graph R(G) ...
Let G be a planar embedded 2-connected graph. Then the vertices of its resonance graph R(G) are the ...
In August 2003 the computer program GRAFFITI made conjecture 1001 stating that for any benzenoid gra...
benzenoid graph, the size of a maximum matching equals the number of positive eigenvalues. Later, th...
AbstractA benzenoid graph is a finite connected plane graph with no cut vertices in which every inte...
AbstractThe phenomenon of resonance amongst a set of different classical chemical structures entails...
The resonance graph R(B) of a benzenoid graph B has the perfect matchings of B as vertices, two perf...
AbstractIt is shown that the number of Clar formulas of a Kekuléan benzenoid system B is equal to th...
AbstractWe consider a partitioning problem, defined for bipartite and 2-connected plane graphs, wher...
The paper presents the results referring to the k-dominating numbers on the linear benzenoid chain (...
The Fibonacci dimension ▫$text{fdim}(G)$▫ of a graph ▫$G$▫ was introduced [in S. Cabello, D. Eppstei...
A benzenoid graph is a finite connected plane graph with no cut vertices in which every interior reg...
As a general case of molecular graphs of benzenoid hydrocarbons, we study plane bipartite graphs wit...
DOI
Add to ORKG