Copertina

Existence of cycles of length divisible by 3 or 4

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Choi, Ilkyoo, Chu, Hojin, Kim, Ringi, Park, Boram
Natura:	Preprint
Pubblicazione:	2026
Soggetti:	Combinatorics
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

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

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

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

Brooks-type theorems for relaxations of square colorings
di: Cho, Eun-Kyung, et al.
Pubblicazione: (2023)

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

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

Characterization of cycle obstruction sets for improper coloring planar graphs
di: Choi, Ilkyoo, et al.
Pubblicazione: (2018)

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

Between proper and square colorings of sparse graphs
di: Choi, Ilkyoo, et al.
Pubblicazione: (2025)

Relaxation of Wegner's Planar Graph Conjecture for maximum degree 4
di: Cho, Eun-Kyung, et al.
Pubblicazione: (2022)

Partition of Sparse Multigraphs into a Forest and a Forest with Restrictions
di: Choi, Ilkyoo, et al.
Pubblicazione: (2025)

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

Digraphs in which every $t$ vertices have exactly $λ$ common out-neighbors
di: Choi, Myungho, et al.
Pubblicazione: (2024)

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

A digraph version of the Friendship Theorem
di: Choi, Myungho, et al.
Pubblicazione: (2023)

Flexible DP 3-coloring of sparse multigraphs
di: Bradshaw, Peter, et al.
Pubblicazione: (2025)

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

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

Digraphs in which every $t$ vertices share exactly $λ$ out-neighbors and exactly $λ$ in-neighbors
di: Chu, Hojin, et al.
Pubblicazione: (2024)

Sufficient conditions for a digraph to contain: a pre-Hamiltonian cycle and cycles of lengths 3 and 4
di: Darbinyan, Samvel Kh.
Pubblicazione: (2025)

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

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

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

A lower bound on the number of edges in DP-critical graphs
di: Bradshaw, Peter, et al.
Pubblicazione: (2024)

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

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

Vertex-disjoint cycles of different lengths in tournaments
di: Bai, Yandong, et al.
Pubblicazione: (2024)

A lower bound on the number of edges in DP-critical graphs. II. Four colors
di: Bradshaw, Peter, et al.
Pubblicazione: (2024)

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

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

A complete solution to the directed Oberwolfach problem of order $2 \pmod{4}$ with cycles of even lengths
di: Burgess, A. C., et al.
Pubblicazione: (2026)

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

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

Acyclic sets and colorings in digraphs under restrictions on degrees and cycle lengths
di: Harutyunyan, Ararat, et al.
Pubblicazione: (2026)

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

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

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

The square of every subcubic planar graph without 4-cycles and 5-cycles is 7-choosable
di: Jin, Ligang, et al.
Pubblicazione: (2025)

Descent set distribution for permutations with cycles of only odd or only even lengths
di: Adin, Ron M., et al.
Pubblicazione: (2025)