On the anti-Kelulé problem of cubic graphs

Qiuli Li, Wai Chee Shiu, Pak Kiu Sun +1

An edge set $S$ of a connected graph $G$ is called an anti-Kekulé set if $G-S$ is connected and has no perfect matchings, where $G-S$ denotes the subgraph obtained by deleting all…