Cover Image

The maximum number of paths of a given length in a nonhamiltonian graph

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Li, Chengli, Zhan, Xingzhi
Format:	Preprint
Published:	2026
Subjects:	Combinatorics 05C30, 05C35, 05C38
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The minimum size and maximum diameter of an edge-pancyclic graph of a given order
by: Li, Chengli, et al.
Published: (2024)

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

The minimum number of detours in a connected graph of minimum degree three
by: Liu, Xining, et al.
Published: (2026)

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

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

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

A conjecture implying Thomassen's chord conjecture in graph theory
by: Zhan, Xingzhi
Published: (2024)

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

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

On extremal Sombor index of trees with a given dissociation number $φ$
by: Das, Joyentanuj
Published: (2022)

Counting geodesic paths in graphs
by: Knor, Martin, et al.
Published: (2026)

Extremal graphs with minimum number of connected subgraphs in a given family
by: Pandey, Dinesh, et al.
Published: (2025)

A sufficient condition for pancyclic graphs
by: Zhan, Xingzhi
Published: (2024)

The subpath number of cactus graphs
by: Knor, Martin, et al.
Published: (2025)

Solution to a $3$-path isolation problem for subcubic graphs
by: Bartolo, Karl, et al.
Published: (2024)

The number of edges in graphs with bounded clique number and circumference
by: Dou, Chunyang, et al.
Published: (2024)

The density of graphs with no $\ell$-path connecting equal-degree vertices: a short proof
by: Attwa, Yamaan, et al.
Published: (2026)

Turán number of the odd-ballooning of complete bipartite graphs
by: Peng, Xing, et al.
Published: (2023)

On saturation numbers of complete multipartite graphs and even cycles
by: Mohammadian, Ali, et al.
Published: (2025)

Invitation to the subpath number
by: Knor, Martin, et al.
Published: (2025)

On the $δ$-chromatic numbers of the Cartesian products of graphs
by: Tangjai, Wipawee, et al.
Published: (2024)

Ore-type conditions for existence of a jellyfish in a graph
by: Kim, Jaehoon, et al.
Published: (2024)

Maximum number of spanning trees and connectivity: Graphs with a fixed minimum degree and bipartite graphs
by: Xu, Shaohan, et al.
Published: (2025)

Size conditions for admissible or consecutive even cycles in graphs
by: Lin, Jifu
Published: (2026)

Even cycles in graphs avoiding longer even cycles
by: Conlon, David, et al.
Published: (2025)

Characterizations of the graphs with dominating parameters
by: Ma, Yuhan
Published: (2024)

Table of large graphs with given degree and diameter
by: Comellas, Francesc
Published: (2024)

Extremal problems about the order and size of nonhamiltonian locally linear graphs
by: Liu, Feng, et al.
Published: (2024)

Rainbow planar Tur{á}n numbers of cycles
by: Liu, Xiaonan
Published: (2025)

Turán-type and tiling problems in oriented graphs
by: Chen, Ming, et al.
Published: (2026)

Chords of longest cycles in graphs with large circumferences
by: Wu, Haidong, et al.
Published: (2025)

Maximum values of the edge Mostar index in tricyclic graphs
by: Hayat, Fazal, et al.
Published: (2023)

Arbitrary orientations of cycles in oriented graphs
by: Wang, Guanghui, et al.
Published: (2025)

Solution to a problem on isolation of $3$-vertex paths
by: Bartolo, Karl, et al.
Published: (2025)

Ore-type condition for antidirected Hamilton cycles in oriented graphs
by: Cai, Junqing, et al.
Published: (2025)

Sparse graphs with an independent or foresty minimum vertex cut
by: Cheng, Kun, et al.
Published: (2024)

A hypergraph analog of Dirac's Theorem for long cycles in 2-connected graphs
by: Kostochka, Alexandr, et al.
Published: (2022)

Nordhaus-Gaddum inequalities for the number of 1-nearly independent vertex subsets
by: Andriantiana, Eric O. D., et al.
Published: (2026)

Chords of longest cycles passing through a specified small set
by: Wu, Haidong, et al.
Published: (2025)

Maximal independent sets in graphs with given matching number
by: Shi, Yongtang, et al.
Published: (2024)