Cover Image

Connectivity keeping trees in triangle-free graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Chu, Hojin, Fujita, Shinya, Park, Boram, Ryu, Homoon
Format:	Preprint
Published:	2025
Subjects:	Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On $2$-connected graphs avoiding cycles of length $0$ modulo $4$
by: Chu, Hojin, et al.
Published: (2025)

Tight upper bounds on the hop domination number of triangle-free graphs
by: Fujita, Shinya, et al.
Published: (2025)

On 2-connected graphs without cycles of length 1 modulo 3
by: Bai, Yandong, et al.
Published: (2026)

Structural properties of a symmetric Toeplitz and Hankel matrices
by: Chu, Hojin, et al.
Published: (2024)

Linear-Time Computation of the Frobenius Normal Form for Symmetric Toeplitz Matrices via Graph-Theoretic Decomposition
by: Chu, Hojin, et al.
Published: (2025)

Monochromatic $k$-connection of graphs
by: Cai, Qingqiong, et al.
Published: (2024)

Existence of cycles of length divisible by 3 or 4
by: Choi, Ilkyoo, et al.
Published: (2026)

Connectivity keeping trees in 3-connected bipartite graphs with girth conditions
by: Yang, Qing, et al.
Published: (2023)

$2$-limited broadcast domination in cubic graphs
by: Choi, Myungho, et al.
Published: (2026)

Blowups of triangle-free graphs
by: Girão, António, et al.
Published: (2024)

Strong odd coloring of sparse graphs
by: Kwon, Hyemin, et al.
Published: (2024)

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

On the evolution of structure in triangle-free graphs
by: Jenssen, Matthew, et al.
Published: (2023)

List colouring triangle free planar graphs
by: Hu, Jianzhang, et al.
Published: (2019)

On the chromatic number of random triangle-free graphs
by: Mizgerd, Clayton, et al.
Published: (2025)

On Toeplitz graphs being line graphs
by: Cheon, Gi-Sang, et al.
Published: (2022)

Suns in triangle-free graphs of large chromatic number
by: Hajebi, Sepehr, et al.
Published: (2025)

11/4-colorability of subcubic triangle-free graphs
by: Dvořák, Zdeněk, et al.
Published: (2022)

On Alon-Tarsi orientations of sparse graphs
by: Cho, Eun-Kyung, et al.
Published: (2025)

Matrix periods and competition periods of Boolean Toeplitz matrices II
by: Cheon, Gi-Sang, et al.
Published: (2024)

Competition graphs of degree bounded digraphs
by: Chu, Hojin, et al.
Published: (2023)

Obstructions for homomorphisms to odd cycles in series-parallel graphs
by: Cho, Eun-Kyung, et al.
Published: (2025)

Extremal triangle-free graphs with chromatic number at least four
by: Ren, Sijie, et al.
Published: (2024)

The strong fractional choice number of triangle-free planar graphs
by: Hu, Xiaolan, et al.
Published: (2026)

Three-coloring triangle-free graphs without long forbidden paths
by: Zhou, Yidong, et al.
Published: (2025)

Dense triangle-free $(n, d, λ)$-graphs for all orders
by: Kim, Jaehoon, et al.
Published: (2024)

Connected triangle-free planar graphs whose second largest eigenvalue is at most 1
by: Cheng, Kun, et al.
Published: (2024)

Coloring triangles in graphs
by: Basu, Ayush, et al.
Published: (2024)

On Vizing's problem for triangle-free graphs
by: Kang, Ross J., et al.
Published: (2023)

The maximum number of triangles in $K_{1,s,t}$-free graphs
by: Calbet, Asier, et al.
Published: (2025)

Partitioning triangle-free planar graphs into a forest and a linear forest
by: Liu, Guanwu, et al.
Published: (2025)

Spectral extremal results for triangle-free graphs with chromatic number at least four
by: Zhu, Yinfen, et al.
Published: (2026)

Counting triangles in regular graphs
by: He, Jialin, et al.
Published: (2023)

Sampling and counting triangle-free graphs near the critical density
by: Jenssen, Matthew, et al.
Published: (2024)

Competition-common enemy graphs of degree-bounded digraphs
by: Choi, Myungho, et al.
Published: (2024)

Tight bound for independent domination of cubic graphs without $4$-cycles
by: Cho, Eun-Kyung, et al.
Published: (2021)

Some remarks on Folkman graphs for triangles
by: Mulrenin, Eion
Published: (2025)

On the 3-colorability of triangle-free and fork-free graphs
by: Schroeder, Joshua, et al.
Published: (2021)

Recolouring Homomorphisms to triangle-free reflexive graphs
by: Lee, Jae-baek, et al.
Published: (2021)

Eigenvalues and triangles in graphs
by: Lin, Huiqiu, et al.
Published: (2019)