Year: 2025
Type: preprint
Abstract: A graph $G$ is called an $[s,t]$-graph if any induced subgraph of $G$ of order $s$ has size at least $t$. In 2024, Zhan conjectured that every $2$-connected $[p + 2, p]$-graph of order at least $2p + 3$ and with minimum degree at least $p$ is pancyclic, where $p$ is an integer with $3 \leq p \leq 5$. In this paper, we confirm the conjecture for the case $p=3$, thereby taking the first step toward a complete resolution of the conjecture.
Source: arXiv (Cornell University)
Authors: Liu, Feng, Liu, Hongxi
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7083510936
Cites:
Cited by:
Related to: