The minimum size of 2-connected chordal bipartite graphs
Combinatorics
2024-10-29 v1
Abstract
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.
Cite
@article{arxiv.2410.20810,
title = {The minimum size of 2-connected chordal bipartite graphs},
author = {Licheng Zhang and Yuanqiu Huang},
journal= {arXiv preprint arXiv:2410.20810},
year = {2024}
}
Comments
9 pages.3 figures