Cover Image

On graphs without cycles of length 1 modulo 3

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bai, Yandong, Li, Binlong, Pan, Yufeng, Zhang, Shenggui
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)

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

Cycle lengths in graphs of given minimum degree
by: Bai, Yandong, et al.
Published: (2025)

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

Closures and heavy pairs for hamiltonicity
by: Shang, Wangyi, et al.
Published: (2024)

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

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

Counting rainbow triangles in edge-colored graphs
by: Li, Xueliang, et al.
Published: (2021)

Characterizing forbidden pairs for spanning $\varTheta$-subgraphs of 2-connected graphs
by: Li, Binlong, et al.
Published: (2025)

Localized and weighted versions of extremal problems
by: Li, Binlong, et al.
Published: (2025)

The anti-Ramsey numbers of cliques in complete multi-partite graphs
by: An, Yuyu, et al.
Published: (2024)

Planar graphs without cycles of length 4 or 5 are $(7m:2m)$-DP-colorable
by: Xu, Xiaoyan, 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)

Minimum saturated graphs without $4$-cycles and $5$-cycles
by: Ma, Yue
Published: (2025)

Max-Bisections of graphs without even cycles
by: Hou, Jianfeng, et al.
Published: (2025)

Triangles in graphs without the expansion of $4$-cycle
by: Song, Jialei, et al.
Published: (2026)

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

On saturation problems for matchings with regularity constraints
by: Yang, Gang, et al.
Published: (2025)

Dean's conjecture and cycles modulo k
by: Luo, Yufan, 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 with distance of 3-cycles at least 2 and no cycles of lengths 5, 6, 7
by: Wang, Tao, et al.
Published: (2025)

Cross-intersecting families with covering number constraints
by: Bai, Yandong, et al.
Published: (2026)

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

Planar graphs without 4-, 7-, 9-cycles and 5-cycles normally adjacent to 3-cycles
by: Liu, Zhengjiao, et al.
Published: (2025)

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

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

The high order spectral radius of graphs without long cycles or paths
by: Wang, Yuntian, et al.
Published: (2025)

Toroidal graphs without $K_{5}^{-}$ and 6-cycles
by: Chen, Ping, et al.
Published: (2025)

Graphs without a rainbow path of length 3
by: Babiński, Sebastian, et al.
Published: (2022)

Optimal $L(d,1)$-labeling of certain direct graph bundles cycles over cycles and Cartesian graph bundles cycles over cycles
by: Ladinek, Irena Hrastnik
Published: (2024)

Variable degeneracy of planar graphs without chorded 6-cycles
by: Fang, Huihui, et al.
Published: (2025)

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

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

Extremal 1-planar graphs without k-cliques
by: Zhang, Licheng, et al.
Published: (2026)

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

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

On Generalized Token Graphs
by: Song, Xiaodi, et al.
Published: (2026)

Spectral extremal problems for non-bipartite graphs without odd cycles
by: Zou, Lantao, et al.
Published: (2025)

The absence of monochromatic triangle implies various properly colored spanning trees
by: Li, Ruonan, et al.
Published: (2024)