A merging procedure produces (A,B)-uniformly ordered labelings for a class of bipartite graphs formed by iteratively adding even cycles and pendant paths, yielding cyclic G-decompositions of K_{2mx+1}.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A merging procedure for labelings of bipartite graphs
A merging procedure produces (A,B)-uniformly ordered labelings for a class of bipartite graphs formed by iteratively adding even cycles and pendant paths, yielding cyclic G-decompositions of K_{2mx+1}.