The minimum size of 2-connected chordal bipartite graphs
Preprint
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.Keywords
All Related Versions
This publication has 9 references indexed in Scilit:
- 4‐Connected 1‐Planar Chordal Graphs Are Hamiltonian‐ConnectedJournal of Graph Theory, 2025
- On the Maximum Number of Edges in Chordal Graphs of Bounded Degree and Matching NumberAlgorithmica, 2022
- Practical graph isomorphism, IIJournal of Symbolic Computation, 2014
- Connectivity keeping edges in graphs with large minimum degreeJournal of Combinatorial Theory, Series B, 2008
- Hamiltonian circuits in chordal bipartite graphsDiscrete Mathematics, 1996
- The NP-completeness of steiner tree and dominating set for chordal bipartite graphsTheoretical Computer Science, 1987
- Perfect Elimination and Chordal Bipartite GraphsJournal of Graph Theory, 1978
- Critically n-Connected GraphsProceedings of the American Mathematical Society, 1972
- On rigid circuit graphsAbhandlungen aus dem Mathematischen Seminar der Universitat Hamburg, 1961