The resonance graph of a plane elementary bipartite graph is constructible from an edge by peripheral convex expansions along a reducible face decomposition if and only if the infinite face is forcing.
Vesel, Characterization of resonance graphs of catacond ensed hexagonal graphs, MATCH Commun
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Peripheral convex expansions of resonance graphs
The resonance graph of a plane elementary bipartite graph is constructible from an edge by peripheral convex expansions along a reducible face decomposition if and only if the infinite face is forcing.