The minimum size of 2-connected chordal bipartite graphs
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913565726736384 |
|---|---|
| author | Zhang, Licheng Huang, Yuanqiu |
| author_facet | Zhang, Licheng Huang, Yuanqiu |
| contents | A bipartite graph is chordal bipartite if every cycle of length at least six contains a chord. We determine the minimum size in 2-connected chordal bipartite graphs with given order. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2410_20810 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | The minimum size of 2-connected chordal bipartite graphs Zhang, Licheng Huang, Yuanqiu Combinatorics 05C35, 05C75 A bipartite graph is chordal bipartite if every cycle of length at least six contains a chord. We determine the minimum size in 2-connected chordal bipartite graphs with given order. |
| title | The minimum size of 2-connected chordal bipartite graphs |
| topic | Combinatorics 05C35, 05C75 |
| url | https://arxiv.org/abs/2410.20810 |