The iterated edge-biclique graph can diverge on necklace graphs and behave like iterated line graphs on burgeon graphs, but the paper's proposed connectivity characterization is false as stated.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DM 1years
2019 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
On the edge-biclique graph and the iterated edge-biclique operator
The iterated edge-biclique graph can diverge on necklace graphs and behave like iterated line graphs on burgeon graphs, but the paper's proposed connectivity characterization is false as stated.