Cycles of lengths 3 and n-1 in digraphs under a Bang-Jensen-Gutin-Li type conditon
Fuente:
arXiv
Guardado en:
| Autores principales: | Zhang, Zan-Bo, Wu, Wenhao, He, Weihua |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
Path Extendable Tournaments
por: Zhang, Zan-Bo, et al.
Publicado: (2025)
por: Zhang, Zan-Bo, et al.
Publicado: (2025)
Tournament completions of bipartite tournaments and their augmented directed cycles
por: Wong, H. W. Willie
Publicado: (2024)
por: Wong, H. W. Willie
Publicado: (2024)
On Mixed Cages
por: Exoo, Geoffrey
Publicado: (2022)
por: Exoo, Geoffrey
Publicado: (2022)
A Fan-type condition for cycles in $1$-tough and $k$-connected $(P_2\cup kP_1)$-free graphs
por: Hu, Zhiquan, et al.
Publicado: (2024)
por: Hu, Zhiquan, et al.
Publicado: (2024)
Construction, Extension and Paths of Near-Homogeneous Tournaments
por: Tang, Rongxia, et al.
Publicado: (2022)
por: Tang, Rongxia, et al.
Publicado: (2022)
Cycles of Length 4 or 8 in Graphs with Diameter 2 and Minimum Degree at Least 3
por: Carr, Avery
Publicado: (2025)
por: Carr, Avery
Publicado: (2025)
Lollipops, dense cycles and chords
por: Dvořák, Zdeněk, et al.
Publicado: (2025)
por: Dvořák, Zdeněk, et al.
Publicado: (2025)
Every Minimal Counterexample to the Erdős-Gyárfás Conjecture is Predominantly Cubic
por: Carr, Avery
Publicado: (2026)
por: Carr, Avery
Publicado: (2026)
A characterization of interval nest digraphs
por: Alcantar, Ayelén, et al.
Publicado: (2026)
por: Alcantar, Ayelén, et al.
Publicado: (2026)
A note on the 2-Factor Hamiltonicity Conjecture
por: Gorsky, Maximilian, et al.
Publicado: (2024)
por: Gorsky, Maximilian, et al.
Publicado: (2024)
Path Eccentricity and Forbidden Induced Subgraphs
por: Cichacz, Sylwia, et al.
Publicado: (2025)
por: Cichacz, Sylwia, et al.
Publicado: (2025)
Gallai's Path Decomposition for 2-degenerate Graphs
por: Anto, Nevil, et al.
Publicado: (2022)
por: Anto, Nevil, et al.
Publicado: (2022)
Dichromatic Number and Cycle Inversions
por: Charbit, Pierre, et al.
Publicado: (2024)
por: Charbit, Pierre, et al.
Publicado: (2024)
On non-planar, cycle-conformal graphs
por: Gorsky, Maximilian, et al.
Publicado: (2026)
por: Gorsky, Maximilian, et al.
Publicado: (2026)
Bounds on the genus for 2-cell embeddings of prefix-reversal graphs
por: Blanco, Saúl A., et al.
Publicado: (2023)
por: Blanco, Saúl A., et al.
Publicado: (2023)
Herscovici Conjecture on Pebbling
por: Dhivviyanandam, I., et al.
Publicado: (2025)
por: Dhivviyanandam, I., et al.
Publicado: (2025)
Sunlet factors for Cartesian products of cycles
por: Jervis, Henry, et al.
Publicado: (2025)
por: Jervis, Henry, et al.
Publicado: (2025)
Transversal Hamilton cycles in digraph collections
por: Cheng, Yangyang, et al.
Publicado: (2025)
por: Cheng, Yangyang, et al.
Publicado: (2025)
Closing Trees into Unicyclic Counterexamples
por: Levit, Vadim E., et al.
Publicado: (2026)
por: Levit, Vadim E., et al.
Publicado: (2026)
Homomorphism Tensors and Linear Equations
por: Grohe, Martin, et al.
Publicado: (2021)
por: Grohe, Martin, et al.
Publicado: (2021)
Towards a conjecture on long induced rainbow paths in triangle-free graphs
por: Aravind, N. R., et al.
Publicado: (2026)
por: Aravind, N. R., et al.
Publicado: (2026)
On the $k$-linkage problem for generalizations of semicomplete digraphs
por: Zhou, Jia, et al.
Publicado: (2025)
por: Zhou, Jia, et al.
Publicado: (2025)
Optimal Path Partitions in Subcubic and Almost-subcubic Graphs
por: Masařík, Tomáš, et al.
Publicado: (2026)
por: Masařík, Tomáš, et al.
Publicado: (2026)
An Ore-type Theorem for Oriented Discrepancy of Hamilton Cycles
por: Chang, Yufei, et al.
Publicado: (2026)
por: Chang, Yufei, et al.
Publicado: (2026)
Temporalizing digraphs via linear-size balanced bi-trees
por: Bessy, Stéphane, et al.
Publicado: (2023)
por: Bessy, Stéphane, et al.
Publicado: (2023)
Digraphs of potential barriers: properties of their tree structure and algorithm for constructing minimum spanning forests
por: Buslov, Vasily
Publicado: (2025)
por: Buslov, Vasily
Publicado: (2025)
When a forest, narrowed to an atom of subset algebra, turns out to be a tree
por: Buslov, Vasily
Publicado: (2025)
por: Buslov, Vasily
Publicado: (2025)
Algorithm for Constructing Related Spanning Directed Forests of Minimum Weight
por: Buslov, Vasily
Publicado: (2025)
por: Buslov, Vasily
Publicado: (2025)
How Trees on Atoms of Subset Algebras Define Minimal Forests and Their Growth
por: Buslov, Vasily
Publicado: (2025)
por: Buslov, Vasily
Publicado: (2025)
Splitting a graph by a given partition of the set of vertices based on the minimum weight of the induced trees
por: Buslov, V. A.
Publicado: (2025)
por: Buslov, V. A.
Publicado: (2025)
A coarse Menger's Theorem for planar and bounded genus graphs
por: Blažej, Václav, et al.
Publicado: (2026)
por: Blažej, Václav, et al.
Publicado: (2026)
Infinite grids in digraphs
por: Hamann, Matthias, et al.
Publicado: (2024)
por: Hamann, Matthias, et al.
Publicado: (2024)
Hyperstability in the Erdős-Sós Conjecture
por: Pokrovskiy, Alexey
Publicado: (2024)
por: Pokrovskiy, Alexey
Publicado: (2024)
The $H$-linkage problems in sparse robustly expanding digraphs
por: Wang, Zhilan, et al.
Publicado: (2026)
por: Wang, Zhilan, et al.
Publicado: (2026)
Openly disjoint cycles and directed tree-width of regular digraphs
por: Steiner, Raphael
Publicado: (2026)
por: Steiner, Raphael
Publicado: (2026)
Almost regular subgraphs under spectral radius constrains
por: Xu, Weilun, et al.
Publicado: (2024)
por: Xu, Weilun, et al.
Publicado: (2024)
Every tree on $n$ edges decomposes $K_{nx,nx}$ and $K_{2nx+1}$
por: Chalise, Parikshit, et al.
Publicado: (2024)
por: Chalise, Parikshit, et al.
Publicado: (2024)
Cycle-factors in oriented graphs
por: Wang, Zhilan, et al.
Publicado: (2024)
por: Wang, Zhilan, et al.
Publicado: (2024)
Topological Indices With Degree Sequence $\mathscr{D}$ of Tree
por: Hamoud, Jasem, et al.
Publicado: (2025)
por: Hamoud, Jasem, et al.
Publicado: (2025)
Orientations of cycles in digraphs of high chromatic number and high minimum out-degree
por: Koerts, Hidde, et al.
Publicado: (2025)
por: Koerts, Hidde, et al.
Publicado: (2025)
Ejemplares similares
-
Path Extendable Tournaments
por: Zhang, Zan-Bo, et al.
Publicado: (2025) -
Tournament completions of bipartite tournaments and their augmented directed cycles
por: Wong, H. W. Willie
Publicado: (2024) -
On Mixed Cages
por: Exoo, Geoffrey
Publicado: (2022) -
A Fan-type condition for cycles in $1$-tough and $k$-connected $(P_2\cup kP_1)$-free graphs
por: Hu, Zhiquan, et al.
Publicado: (2024) -
Construction, Extension and Paths of Near-Homogeneous Tournaments
por: Tang, Rongxia, et al.
Publicado: (2022)