Splitting vertices of bipartite graphs preserves de Bruijn-Erdős property
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914166444392448 |
|---|---|
| author | Beaudou, Laurent Quintero, Guillermo Gamboa |
| author_facet | Beaudou, Laurent Quintero, Guillermo Gamboa |
| contents | In this note, we prove that every graph obtained from a bipartite graph by iteratively splitting vertices into two adjacent twins has the de Bruijn-Erdős property. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_17156 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Splitting vertices of bipartite graphs preserves de Bruijn-Erdős property Beaudou, Laurent Quintero, Guillermo Gamboa Discrete Mathematics Combinatorics In this note, we prove that every graph obtained from a bipartite graph by iteratively splitting vertices into two adjacent twins has the de Bruijn-Erdős property. |
| title | Splitting vertices of bipartite graphs preserves de Bruijn-Erdős property |
| topic | Discrete Mathematics Combinatorics |
| url | https://arxiv.org/abs/2511.17156 |