:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Choi, Ilkyoo, Chu, Hojin, Kim, Ringi, Park, Boram
Format:	Preprint
Published:	2026
Subjects:	Combinatorics
Online Access:	https://arxiv.org/abs/2605.02731
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)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Perfect weighted divisibility is equivalent to perfect divisibility
by: Hu, Qiming, 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)

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)

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

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

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

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)

Planar graphs having no cycle of length $4$, $6$ or $8$ are DP-3-colorable
by: Jin, Ligang, et al.
Published: (2024)