Sufficient conditions for a digraph to contain: a pre-Hamiltonian cycle and cycles of lengths 3 and 4
Fuente:
arXiv
Guardado en:
| Autor principal: | Darbinyan, Samvel Kh. |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
On Hamiltonian bypasses in digraphs and bipartite digraphs
por: Darbinyan, Samvel Kh.
Publicado: (2025)
por: Darbinyan, Samvel Kh.
Publicado: (2025)
A new sufficient condition for a 2-strong digraph to be Hamiltonian
por: Darbinyan, Samvel Kh.
Publicado: (2023)
por: Darbinyan, Samvel Kh.
Publicado: (2023)
On Three Conjectures of Thomassen and the Extremal Digraphs for Two Conjectures of Nash‐Williams
por: Samvel Kh. Darbinyan
Publicado: (2025)
por: Samvel Kh. Darbinyan
Publicado: (2025)
Sufficient conditions for closed-trailable in digraphs
por: Dong, Changchang, et al.
Publicado: (2024)
por: Dong, Changchang, et al.
Publicado: (2024)
Acyclic sets and colorings in digraphs under restrictions on degrees and cycle lengths
por: Harutyunyan, Ararat, et al.
Publicado: (2026)
por: Harutyunyan, Ararat, et al.
Publicado: (2026)
A generalization of the Hamiltonian cycle in dense digraphs
por: Zhang, Jie, et al.
Publicado: (2024)
por: Zhang, Jie, et al.
Publicado: (2024)
Existence of cycles of length divisible by 3 or 4
por: Choi, Ilkyoo, et al.
Publicado: (2026)
por: Choi, Ilkyoo, et al.
Publicado: (2026)
Extremal digraphs containing at most $t$ paths of length 2 with the same endpoints
por: Huang, Zejun, et al.
Publicado: (2024)
por: Huang, Zejun, et al.
Publicado: (2024)
Dividing sums of cycles in the semiring of functional digraphs
por: Bridoux, Florian, et al.
Publicado: (2025)
por: Bridoux, Florian, et al.
Publicado: (2025)
Redicolouring digraphs: directed treewidth and cycle-degeneracy
por: Nisse, Nicolas, et al.
Publicado: (2023)
por: Nisse, Nicolas, et al.
Publicado: (2023)
Hamilton cycles in random digraphs with minimum degree at least one
por: Cooper, Colin, et al.
Publicado: (2023)
por: Cooper, Colin, et al.
Publicado: (2023)
Eigenvalues and cycles of consecutive lengths
por: Li, Binlong, et al.
Publicado: (2021)
por: Li, Binlong, et al.
Publicado: (2021)
Unavoidable butterfly minors in digraphs of large cycle rank
por: Hatzel, Meike, et al.
Publicado: (2025)
por: Hatzel, Meike, et al.
Publicado: (2025)
Transversal Hamilton cycles in digraph collections
por: Cheng, Yangyang, et al.
Publicado: (2025)
por: Cheng, Yangyang, et al.
Publicado: (2025)
Edge disjoint Hamilton cycles in random digraphs of constant minimum degree
por: Cooper, Colin, et al.
Publicado: (2026)
por: Cooper, Colin, et al.
Publicado: (2026)
On graphs without cycles of length 1 modulo 3
por: Bai, Yandong, et al.
Publicado: (2025)
por: Bai, Yandong, et al.
Publicado: (2025)
Sufficient conditions for $t$-tough graphs to be Hamiltonian and pancyclic or bipartite
por: Liu, Xiangge, et al.
Publicado: (2025)
por: Liu, Xiangge, et al.
Publicado: (2025)
On the length of directed paths in digraphs
por: Cheng, Yangyang, et al.
Publicado: (2024)
por: Cheng, Yangyang, et al.
Publicado: (2024)
On Tutte cycles containing three prescribed edges
por: Wigal, Michael C., et al.
Publicado: (2021)
por: Wigal, Michael C., et al.
Publicado: (2021)
On $2$-connected graphs avoiding cycles of length $0$ modulo $4$
por: Chu, Hojin, et al.
Publicado: (2025)
por: Chu, Hojin, et al.
Publicado: (2025)
Vertex-disjoint cycles of different lengths in tournaments
por: Bai, Yandong, et al.
Publicado: (2024)
por: Bai, Yandong, et al.
Publicado: (2024)
Chi-boundedness of graphs containing no cycles with $k$ chords
por: Lee, Joonkyung, et al.
Publicado: (2022)
por: Lee, Joonkyung, et al.
Publicado: (2022)
On 2-connected graphs without cycles of length 1 modulo 3
por: Bai, Yandong, et al.
Publicado: (2026)
por: Bai, Yandong, et al.
Publicado: (2026)
Sufficient conditions for Hamiltonianity in terms of the Zeroth-order General Randić Index
por: Wang, Shuai, et al.
Publicado: (2026)
por: Wang, Shuai, et al.
Publicado: (2026)
Planar graphs with distance of 3-cycles at least 2 and no cycles of lengths 5, 6, 7
por: Wang, Tao, et al.
Publicado: (2025)
por: Wang, Tao, et al.
Publicado: (2025)
Hamiltonian cycles in tough $(P_4 \cup P_1)$-free graphs
por: Shan, Songling
Publicado: (2025)
por: Shan, Songling
Publicado: (2025)
Counting pairs of cycles whose product is a permutation with restricted cycle lengths
por: Bona, Miklos, et al.
Publicado: (2024)
por: Bona, Miklos, et al.
Publicado: (2024)
Degree conditions forcing directed cycles
por: Grzesik, Andrzej, et al.
Publicado: (2021)
por: Grzesik, Andrzej, et al.
Publicado: (2021)
Operadic structure on Hamiltonian paths and cycles
por: Lyskov, Denis
Publicado: (2024)
por: Lyskov, Denis
Publicado: (2024)
A note on two cycles of consecutive even lengths in graphs
por: Li, Binlong, et al.
Publicado: (2025)
por: Li, Binlong, et al.
Publicado: (2025)
Balanced clique subdivisions and cycles lengths in $K_{s, t}$-free graphs
por: Hou, Jianfeng, et al.
Publicado: (2024)
por: Hou, Jianfeng, et al.
Publicado: (2024)
Generalized paths and cycles in semicomplete multipartite digraphs
por: Bang-Jensen, Jørgen, et al.
Publicado: (2024)
por: Bang-Jensen, Jørgen, et al.
Publicado: (2024)
Signless Laplacian spectral conditions: Forbidden $4$-cycle and star embeddings
por: Wei, Zhe, et al.
Publicado: (2026)
por: Wei, Zhe, et al.
Publicado: (2026)
Powers of Hamiltonian cycles in randomly augmented Pósa-Seymour graphs
por: Antoniuk, Sylwia, et al.
Publicado: (2025)
por: Antoniuk, Sylwia, et al.
Publicado: (2025)
Minimum saturated graphs without $4$-cycles and $5$-cycles
por: Ma, Yue
Publicado: (2025)
por: Ma, Yue
Publicado: (2025)
Odd and even cycle lengths, minimum degree and chromatic number in graphs
por: Wang, Xiaolin
Publicado: (2025)
por: Wang, Xiaolin
Publicado: (2025)
Hamiltonian cycles in $ 15 $-tough ($ P_{3}\cup 3P_{1} $)-free graphs
por: Ma, Hui, et al.
Publicado: (2025)
por: Ma, Hui, et al.
Publicado: (2025)
Decompositions of some classes of regular graphs into cycles and paths of length eight
por: C, Cecily Sahai., et al.
Publicado: (2023)
por: C, Cecily Sahai., et al.
Publicado: (2023)
Hamiltonian decompositions of the wreath product of hamiltonian decomposable digraphs
por: Lacaze-Masmonteil, Alice
Publicado: (2024)
por: Lacaze-Masmonteil, Alice
Publicado: (2024)
Long cycles in vertex transitive digraphs
por: Bucić, Matija, et al.
Publicado: (2026)
por: Bucić, Matija, et al.
Publicado: (2026)
Ejemplares similares
-
On Hamiltonian bypasses in digraphs and bipartite digraphs
por: Darbinyan, Samvel Kh.
Publicado: (2025) -
A new sufficient condition for a 2-strong digraph to be Hamiltonian
por: Darbinyan, Samvel Kh.
Publicado: (2023) -
On Three Conjectures of Thomassen and the Extremal Digraphs for Two Conjectures of Nash‐Williams
por: Samvel Kh. Darbinyan
Publicado: (2025) -
Sufficient conditions for closed-trailable in digraphs
por: Dong, Changchang, et al.
Publicado: (2024) -
Acyclic sets and colorings in digraphs under restrictions on degrees and cycle lengths
por: Harutyunyan, Ararat, et al.
Publicado: (2026)