Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2026
|
| Soggetti: | |
| Accesso online: | https://arxiv.org/abs/2605.13610 |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866913123505537024 |
|---|---|
| author | Bonacini, Paola Marino, Lucia |
| author_facet | Bonacini, Paola Marino, Lucia |
| contents | Let $G$ a bipartite graph with vertex bipartition $\{A,B\}$ and let $m=|E(G)|$. An $(A,B)$-uniformly ordered labeling of $G$ is a labeling $f\colon V\rightarrow [0,2m]$ which, among other conditions, requires that there exists $λ\in \mathbb N$ such that $f(a)\le λ$ and $f(b)>λ$ for all $a\in A$ and $b\in B$. The existence of such a labeling for $G$ implies the existence of a cyclic $G$-decomposition of $K_{2mx+1}$ for all positive integers $x$. In this paper, as a starting point, through this type of labeling we prove the existence of a cyclic $G$-decomposition in the case that $G$ is a cycle of even length with either one or two pendant paths of any length. Then, through a merging procedure, we are able to get this type of labeling for a specific class of bipartite graphs, which are obtained by iteratively adding an even cycle and a pendant path. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_13610 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | A merging procedure for labelings of bipartite graphs Bonacini, Paola Marino, Lucia Combinatorics 05c78 Let $G$ a bipartite graph with vertex bipartition $\{A,B\}$ and let $m=|E(G)|$. An $(A,B)$-uniformly ordered labeling of $G$ is a labeling $f\colon V\rightarrow [0,2m]$ which, among other conditions, requires that there exists $λ\in \mathbb N$ such that $f(a)\le λ$ and $f(b)>λ$ for all $a\in A$ and $b\in B$. The existence of such a labeling for $G$ implies the existence of a cyclic $G$-decomposition of $K_{2mx+1}$ for all positive integers $x$. In this paper, as a starting point, through this type of labeling we prove the existence of a cyclic $G$-decomposition in the case that $G$ is a cycle of even length with either one or two pendant paths of any length. Then, through a merging procedure, we are able to get this type of labeling for a specific class of bipartite graphs, which are obtained by iteratively adding an even cycle and a pendant path. |
| title | A merging procedure for labelings of bipartite graphs |
| topic | Combinatorics 05c78 |
| url | https://arxiv.org/abs/2605.13610 |