Cover Image

Connectivity keeping trees in 3-connected bipartite graphs with girth conditions

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Yang, Qing, Tian, Yingzhi
Format:	Preprint
Published:	2023
Subjects:	Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Proof a conjecture on connectivity keeping odd paths in k-connected bipartite graphs
by: Yang, Qing, et al.
Published: (2022)

Connectivity keeping paths for k-connected bipartite graphs
by: Ji, Meng
Published: (2023)

The 3-restricted edge-connectivity of the direct product graphs
by: Wang, Wenxin, et al.
Published: (2025)

Connectivity keeping trees in triangle-free graphs
by: Chu, Hojin, et al.
Published: (2025)

The Restricted Edge-Connectivity of Strong Product Graphs
by: Ye, Hazhe, et al.
Published: (2024)

Graphs with a given conditional diameter that maximize the Wiener index
by: An, Junfeng, et al.
Published: (2024)

Extremal Problems for the Family of $k$-Strongly Connected Digraphs
by: Wang, Qinglin, et al.
Published: (2026)

The 3-restricted Edge-Connectivity of Strong Product Graphs
by: Wang, Wenxin, et al.
Published: (2026)

On the Steiner $k$-diameter and Steiner ($k,k^{\prime}$)-radius of trees
by: Zhang, Qingnan, et al.
Published: (2025)

Packing large balanced trees into bipartite graphs
by: Fernandes, Cristina G., et al.
Published: (2024)

The Ferrers bound for spanning trees in bipartite graphs
by: Ho, Boon Suan
Published: (2026)

Laplacian eigenvalue distribution and girth of graphs
by: Zhen, Wenhao, et al.
Published: (2025)

On the girth and connectivity of cubic graphs with a unique longest cycle
by: Jooken, Jorik, et al.
Published: (2024)

A sufficient condition for cubic 3-connected plane bipartite graphs to be hamiltonian
by: Florek, Jan
Published: (2023)

Sufficient conditions for $t$-tough graphs to be Hamiltonian and pancyclic or bipartite
by: Liu, Xiangge, et al.
Published: (2025)

Revisiting $d$-distance (independent) domination in trees and in bipartite graphs
by: Bujtás, Csilla, et al.
Published: (2025)

Cubic vertex-transitive graphs of girth seven
by: Lekše, Maruša, et al.
Published: (2025)

On cubic vertex-transitive graphs of given girth
by: Dobson, Ted, et al.
Published: (2025)

Exhaustive generation of edge-girth-regular graphs
by: Goedgebeur, Jan, et al.
Published: (2024)

Size of bipartite graphs with given diameter and connectivity constraints
by: Mafunda, Sonwabile
Published: (2025)

Characterizing the positive inertia index of connected signed graphs in terms of girth
by: Khan, Suliman, et al.
Published: (2025)

Stiffness matrices of graph blow-ups and the $d$-dimensional algebraic connectivity of complete bipartite graphs
by: Jung, Yunseong, et al.
Published: (2025)

A spectral condition for Hamilton cycles in tough bipartite graphs
by: Ai, Lianyang, et al.
Published: (2025)

Sufficient conditions for bipartite rigidity, symmetric completability and hyperconnectivity of graphs
by: Garamvölgyi, Dániel, et al.
Published: (2025)

The smallest normalized signless $\infty$-Laplacian eigenvalue for non-bipartite connected graphs
by: Dai, Yi
Published: (2024)

Oriented trees in digraphs with large girth
by: Lu, Junying, et al.
Published: (2025)

Enumeration of rooted 3-connected bipartite planar maps
by: Noy, Marc, et al.
Published: (2022)

Induced subdivisions in graphs of large girth
by: Kuang, Peiru, et al.
Published: (2026)

A spectral condition for spanning trees with restricted degrees in bipartite graphs
by: Wu, Jiancheng, et al.
Published: (2024)

Highly connected graphs have highly connected spanning bipartite subgraphs
by: Yuster, Raphael
Published: (2024)

Induced subdivisions of $K_{d+1}$ in graphs of high girth
by: Girão, António, et al.
Published: (2026)

On conflict-free colorings of cyclic polytopes and the girth conjecture for graphs
by: Lee, Seunghun, et al.
Published: (2024)

A non-existence result for vertex-girth-regular graphs
by: Jooken, Jorik, et al.
Published: (2026)

On vertex-girth-regular graphs: (Non-)existence, bounds and enumeration
by: Jajcay, Robert, et al.
Published: (2024)

Forcibly unicyclic and bicyclic graphic sequences
by: Duan, Peiyi, et al.
Published: (2025)

The minimum size of 2-connected chordal bipartite graphs
by: Zhang, Licheng, et al.
Published: (2024)

Cubic vertex-transitive graphs of girth six
by: Potočnik, Primož, et al.
Published: (2020)

On bipartite biregular large graphs
by: Araujo-Pardo, G., et al.
Published: (2024)

Geometric graphs with exponential chromatic number and arbitrary girth
by: Bucić, Matija, et al.
Published: (2023)

On quadratic embeddability of bipartite graphs and theta graphs
by: Młotkowski, Wojciech, et al.
Published: (2024)