Cycle lengths in graphs of given minimum degree
Fuente:
arXiv
Saved in:
| Main Authors: | Bai, Yandong, Grzesik, Andrzej, Li, Binlong, Prorok, Magdalena |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
On graphs without cycles of length 1 modulo 3
by: Bai, Yandong, et al.
Published: (2025)
by: Bai, Yandong, et al.
Published: (2025)
Directed graphs without rainbow stars
by: Gerbner, Daniel, et al.
Published: (2024)
by: Gerbner, Daniel, et al.
Published: (2024)
On 2-connected graphs without cycles of length 1 modulo 3
by: Bai, Yandong, et al.
Published: (2026)
by: Bai, Yandong, et al.
Published: (2026)
Graphs without a rainbow path of length 3
by: Babiński, Sebastian, et al.
Published: (2022)
by: Babiński, Sebastian, et al.
Published: (2022)
Antidirected paths in oriented graphs
by: Grzesik, Andrzej, et al.
Published: (2025)
by: Grzesik, Andrzej, et al.
Published: (2025)
The minimum size of a chordal graph with given order and minimum degree
by: Zhan, Xingzhi, et al.
Published: (2024)
by: Zhan, Xingzhi, et al.
Published: (2024)
Subgraphs with a positive minimum semidegree in digraphs with large outdegree
by: Grzesik, Andrzej, et al.
Published: (2024)
by: Grzesik, Andrzej, et al.
Published: (2024)
The circumference of a graph with given minimum degree and clique number
by: Chen, Na, et al.
Published: (2025)
by: Chen, Na, et al.
Published: (2025)
A note on two cycles of consecutive even lengths in graphs
by: Li, Binlong, et al.
Published: (2025)
by: Li, Binlong, et al.
Published: (2025)
The maximum number of cliques in graphs with given fractional matching number and minimum degree
by: Li, Chengli, et al.
Published: (2024)
by: Li, Chengli, et al.
Published: (2024)
A strengthening on consecutive odd cycles in graphs of given minimum degree
by: Lin, Hao, et al.
Published: (2024)
by: Lin, Hao, et al.
Published: (2024)
Eigenvalues and cycles of consecutive lengths
by: Li, Binlong, et al.
Published: (2021)
by: Li, Binlong, et al.
Published: (2021)
Strong modeling limits of graphs with bounded tree-width
by: Grzesik, Andrzej, et al.
Published: (2021)
by: Grzesik, Andrzej, et al.
Published: (2021)
The maximum size of a nonhamiltonian-connected graph with given order and minimum degree
by: Zhang, Leilei
Published: (2024)
by: Zhang, Leilei
Published: (2024)
A closure result on spanning $k$-trees of graphs with given minimum degree
by: Zhang, Wenqian
Published: (2026)
by: Zhang, Wenqian
Published: (2026)
On the oriented diameter of graphs with given minimum degree
by: Cochran, Garner, et al.
Published: (2024)
by: Cochran, Garner, et al.
Published: (2024)
Size and spectral conditions for a graph with given minimum degree to be $k$-$d$-critical
by: Zhang, Zhenhao, et al.
Published: (2026)
by: Zhang, Zhenhao, et al.
Published: (2026)
Degree conditions forcing directed cycles
by: Grzesik, Andrzej, et al.
Published: (2021)
by: Grzesik, Andrzej, et al.
Published: (2021)
Odd and even cycle lengths, minimum degree and chromatic number in graphs
by: Wang, Xiaolin
Published: (2025)
by: Wang, Xiaolin
Published: (2025)
Balanced bipartite distance of $K_4$-free graphs
by: Balogh, József, et al.
Published: (2026)
by: Balogh, József, et al.
Published: (2026)
On the distance spectral radius, fractional matching and factors of graphs with given minimum degree
by: Xu, Zengzhao, et al.
Published: (2023)
by: Xu, Zengzhao, et al.
Published: (2023)
Vertex-disjoint cycles of different lengths in tournaments
by: Bai, Yandong, et al.
Published: (2024)
by: Bai, Yandong, et al.
Published: (2024)
The minimum edge-pancyclic graph of a given order
by: Zhao, Xiamiao, et al.
Published: (2025)
by: Zhao, Xiamiao, et al.
Published: (2025)
Directed Graphs Without Rainbow Triangles
by: Sebastian Babiński, et al.
Published: (2025)
by: Sebastian Babiński, et al.
Published: (2025)
The double Hall property and cycle covers in bipartite graphs
by: Barát, János, et al.
Published: (2023)
by: Barát, János, et al.
Published: (2023)
On $k$-colorability of $(bull, H)$-free graphs
by: Hodur, Nadzieja, et al.
Published: (2025)
by: Hodur, Nadzieja, et al.
Published: (2025)
On 3-colourability of $(bull, H)$-free graphs
by: Hodur, Nadzieja, et al.
Published: (2024)
by: Hodur, Nadzieja, et al.
Published: (2024)
Characterizing forbidden pairs for spanning $\varTheta$-subgraphs of 2-connected graphs
by: Li, Binlong, et al.
Published: (2025)
by: Li, Binlong, et al.
Published: (2025)
The minimum number of maximal independent sets in graphs with given order and independence number
by: Tian, Yuting, et al.
Published: (2024)
by: Tian, Yuting, et al.
Published: (2024)
Bipartite graphs with minimum degree at least 15 are antimagic
by: Deng, Kecai
Published: (2025)
by: Deng, Kecai
Published: (2025)
Building graphs with high minimum degree on a budget
by: Katsamaktsis, Kyriakos, et al.
Published: (2024)
by: Katsamaktsis, Kyriakos, et al.
Published: (2024)
Compatible Hamilton cycles in graphs with large minimum degree
by: Behague, Natalie, et al.
Published: (2026)
by: Behague, Natalie, et al.
Published: (2026)
Cycles and paths through specified vertices in graphs with a given clique number
by: Li, Chengli, et al.
Published: (2025)
by: Li, Chengli, et al.
Published: (2025)
Tight minimum colored degree condition for rainbow connectivity
by: Czygrinow, Andrzej, et al.
Published: (2024)
by: Czygrinow, Andrzej, et al.
Published: (2024)
Improved bounds for the minimum degree of minimal multicolor Ramsey graphs
by: Attwa, Yamaan, et al.
Published: (2025)
by: Attwa, Yamaan, et al.
Published: (2025)
On the existence of minimally tough graphs having large minimum degrees
by: Hasanvand, Morteza
Published: (2025)
by: Hasanvand, Morteza
Published: (2025)
Localized and weighted versions of extremal problems
by: Li, Binlong, et al.
Published: (2025)
by: Li, Binlong, et al.
Published: (2025)
Diameters and mixing times for giant components of random graphs with given degrees
by: Addario-Berry, Louigi, et al.
Published: (2026)
by: Addario-Berry, Louigi, et al.
Published: (2026)
Paired domination in graphs with minimum degree four
by: Bujtás, Csilla, et al.
Published: (2025)
by: Bujtás, Csilla, et al.
Published: (2025)
Total coloring graphs with large minimum degree
by: Henderschedt, Owen, et al.
Published: (2025)
by: Henderschedt, Owen, et al.
Published: (2025)
Similar Items
-
On graphs without cycles of length 1 modulo 3
by: Bai, Yandong, et al.
Published: (2025) -
Directed graphs without rainbow stars
by: Gerbner, Daniel, et al.
Published: (2024) -
On 2-connected graphs without cycles of length 1 modulo 3
by: Bai, Yandong, et al.
Published: (2026) -
Graphs without a rainbow path of length 3
by: Babiński, Sebastian, et al.
Published: (2022) -
Antidirected paths in oriented graphs
by: Grzesik, Andrzej, et al.
Published: (2025)