Imagen de Portada

Cycles and paths through vertices whose degrees are at least the bipartite-hole-number

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Li, Chengli, Liu, Feng, Tang, Yurui
Formato:	Preprint
Publicado:	2025
Materias:	Combinatorics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

The maximum number of cliques in graphs with given fractional matching number and minimum degree
por: Li, Chengli, et al.
Publicado: (2024)

Cycles and paths through specified vertices in graphs with a given clique number
por: Li, Chengli, et al.
Publicado: (2025)

Extending two results on hamiltonian graphs involving the bipartite-hole-number
por: Cheng, Kun, et al.
Publicado: (2025)

Bound vertices of longest paths between two vertices in cubic graphs
por: Li, Chengli, et al.
Publicado: (2024)

The circumference of a graph with given minimum degree and clique number
por: Chen, Na, et al.
Publicado: (2025)

Trees whose even-degree vertices induce a path are antimagic
por: Lozano, Antoni, et al.
Publicado: (2019)

Graphs whose vertices of degree at least 2 lie in a triangle
por: Forte, Vinicius L. do, et al.
Publicado: (2022)

Weakly pancyclic vertices in dense nonbipartite graphs
por: Tang, Yurui, et al.
Publicado: (2026)

The minimum size of a $k$-connected locally nonforesty graph
por: Li, Chengli, et al.
Publicado: (2025)

The minimum size of a $3$-connected locally nonforesty graph
por: Li, Chengli, et al.
Publicado: (2024)

The maximum number of paths of a given length in a nonhamiltonian graph
por: Li, Chengli, et al.
Publicado: (2026)

Proper 3-orientations of bipartite planar graphs with minimum degree at least 3
por: Noguchi, Kenta
Publicado: (2019)

An Ore-type condition for hamiltonicity in graphs
por: Li, Chengli, et al.
Publicado: (2025)

The distance spectral radius of $k$-uniform hypertrees with given number of vertices of maximum degree
por: Liu, Xiaoqi, et al.
Publicado: (2024)

Every $2$-connected $[4, 2]$-graph of order at least seven contains a pancyclic edge
por: Li, Chengli, et al.
Publicado: (2025)

Constructions of minimally $t$-tough regular graphs
por: Cheng, Kun, et al.
Publicado: (2024)

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

Bipartite graphs with minimum degree at least 15 are antimagic
por: Deng, Kecai
Publicado: (2025)

Dense minors and bipartite independence numbers
por: Wang, Xia, et al.
Publicado: (2025)

On the structural growth of bipartite Ramsey numbers
por: Ji, Meng
Publicado: (2026)

Connectivity keeping paths for k-connected bipartite graphs
por: Ji, Meng
Publicado: (2023)

Cycles of consecutive lengths in $3$-connected graphs
por: Li, Chengli, et al.
Publicado: (2025)

Hamilton cycles in random digraphs with minimum degree at least one
por: Cooper, Colin, et al.
Publicado: (2023)

Turán number of complete bipartite graphs with bounded matching number
por: Luo, Huan, et al.
Publicado: (2024)

The distinguishing number of complete bipartite and crown graphs
por: Chen, Lei, et al.
Publicado: (2026)

Slit-Slide-Sew bijections for planar bipartite maps with prescribed degree
por: Schabanel, Juliette
Publicado: (2025)

Removal paths avoiding vertices
por: Qi, Yuzhen, et al.
Publicado: (2024)

The generalized Turán number for K_3 in graphs without suspensions of a path on five vertices
por: Hei, Doudou, et al.
Publicado: (2025)

Anti-Ramsey numbers of loose paths and cycles in uniform hypergraphs
por: Li, Tong, et al.
Publicado: (2024)

On values of $\mathfrak{sl}_3$ weight system on chord diagrams whose intersection graph is complete bipartite
por: Yang, Zhuoke
Publicado: (2021)

The detour covering number and cummerbund covering number of a graph
por: Li, Chengli, et al.
Publicado: (2025)

Weak saturation numbers of large complete bipartite graphs
por: Akhmejanova, Margarita, et al.
Publicado: (2025)

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

The chromatic number of $\mathbb{R}^8$ is at least 25
por: Parts, Jaan
Publicado: (2026)

Monochromatic cycles in 2-edge-colored bipartite graphs with large minimum degree
por: Zhang, Yiran, et al.
Publicado: (2023)

Hypertree shrinking avoiding low degree vertices
por: Hylasová, Karolína, et al.
Publicado: (2024)

Extremal triangle-free graphs with chromatic number at least four
por: Ren, Sijie, et al.
Publicado: (2024)

The fractional chromatic number of the plane is at least 4
por: Matolcsi, Máté, et al.
Publicado: (2023)

A complement of the Erdős-Hajnal problem on paths with equal-degree endpoints
por: Liu, Zhen, et al.
Publicado: (2025)

On pyramidal groups whose number of involutions is a prime power
por: Gao, Xiaofang, et al.
Publicado: (2023)