Zhongyuan Che

activity

20242026

collaborators

5 papers

math.CO2026

Isomorphic daisy cubes based on their $I ¨ $ -graphs

Zhongyuan Che, Niko Tratnik, Petra Å½igert PleterÅ¡ek

We prove that if $A$ and $B$ are daisy cubes whose $I ¨ $ -graphs are forests, then $A$ and $B$ are isomorphic if and only if their $I ¨ $ -graphs are isomorphic. The result is applied t…

math.CO2026

Resonance graphs that are daisy cubes: from hypercubes to independent sets via resonant sets

Simon Brezovnik, Zhongyuan Che, Niko Tratnik +1

Let $G$ be a plane elementary bipartite graph whose infinite face is forcing. We provide a bijection between the set of maximal hypercubes of its resonance graph and the set of max…

math.CO2025

A decomposition structure of resonance graphs that are daisy cubes

Zhongyuan Che, Zhibo Chen

It has recently been shown in [\emph{Discrete Appl. Math.} {\bf 366} (2025) 75--85] that the resonance graph of a plane elementary bipartite graph $G$ is a daisy cube if and only i…

math.CO2024

Resonance graphs of plane bipartite graphs as daisy cubes

Simon Brezovnik, Zhongyuan Che, Niko Tratnik +1

We characterize plane bipartite graphs whose resonance graphs are daisy cubes, and therefore generalize related results on resonance graphs of benzenoid graphs, catacondensed even…