Cover Image

On $2$-connected graphs avoiding cycles of length $0$ modulo $4$

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Chu, Hojin, 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 without cycles of length 1 modulo 3
by: Bai, Yandong, et al.
Published: (2026)

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

Existence of cycles of length divisible by 3 or 4
by: Choi, Ilkyoo, 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)

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

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

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

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

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

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

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

Longest cycles and longest chordless cycles in $2$-connected graphs
by: Hu, Yanan, et al.
Published: (2024)

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)

Disjoint chorded cycles in a $2$-connected graph
by: Lu, Zaiping, et al.
Published: (2025)

Simultaneous avoidance of length-4 patterns in ascent sequences
by: Liu, Qi, et al.
Published: (2026)

Unavoidable cycle-contraction minors of large $2$-connected graphs
by: Ge, Wayne, et al.
Published: (2025)

Even cycles in graphs avoiding longer even cycles
by: Conlon, David, et al.
Published: (2025)

A note on cycles in cyclically $4$-edge-connected cubic planar graphs
by: Lo, On-Hei Solomon
Published: (2026)

Planar graphs without cycles of length 4 or 5 are $(7m:2m)$-DP-colorable
by: Xu, Xiaoyan, et al.
Published: (2025)

A note on two cycles of consecutive even lengths in graphs
by: Li, Binlong, et al.
Published: (2025)

Balanced clique subdivisions and cycles lengths in $K_{s, t}$-free graphs
by: Hou, Jianfeng, et al.
Published: (2024)

Dean's conjecture and cycles modulo k
by: Luo, Yufan, et al.
Published: (2026)

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

Color-avoiding connected colorings and orientations
by: Pintér, József, et al.
Published: (2025)

Intersections of longest cycles in vertex-transitive and highly connected graphs
by: Ma, Jie, et al.
Published: (2025)

Odd and even cycle lengths, minimum degree and chromatic number in graphs
by: Wang, Xiaolin
Published: (2025)

Decompositions of some classes of regular graphs into cycles and paths of length eight
by: C, Cecily Sahai., et al.
Published: (2023)

Binary operations on pattern-avoiding cycles
by: Archer, Kassie, et al.
Published: (2025)

Planar graphs with distance of 3-cycles at least 2 and no cycles of lengths 5, 6, 7
by: Wang, Tao, et al.
Published: (2025)

On the local resilience of random geometric graphs with respect to connectivity and long cycles
by: Díaz, Alberto Espuny, et al.
Published: (2024)

Packing $A$-paths of length zero modulo a prime
by: Thomas, Robin, et al.
Published: (2020)

Squares of subcubic planar graphs without cycles of length 4-8 are 6-choosable
by: Kim, Seog-Jin, et al.
Published: (2025)

4-connected 1-planar chordal graphs are Hamiltonian-connected
by: Zhang, Licheng, et al.
Published: (2024)

The generalized 4-connectivity of godan graphs
by: Wang, Jing, et al.
Published: (2024)

On a conjecture about pattern avoidance of cycle permutations
by: Pan, Junyao
Published: (2024)

Eigenvalues and cycles of consecutive lengths
by: Li, Binlong, et al.
Published: (2021)