A sufficient condition for pancyclic graphs
Fuente:
arXiv
Saved in:
| Main Author: | Zhan, Xingzhi |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Every $2$-connected $[4, 2]$-graph of order at least seven contains a pancyclic edge
by: Li, Chengli, et al.
Published: (2025)
by: Li, Chengli, et al.
Published: (2025)
The minimum size and maximum diameter of an edge-pancyclic graph of a given order
by: Li, Chengli, et al.
Published: (2024)
by: Li, Chengli, et al.
Published: (2024)
On the Hamiltonicity, traceability and toughness of complements of line graphs
by: Mammoliti, Adam
Published: (2026)
by: Mammoliti, Adam
Published: (2026)
An updated survey on 2-Factors of Regular Graphs
by: Labbate, D., et al.
Published: (2024)
by: Labbate, D., et al.
Published: (2024)
A conjecture implying Thomassen's chord conjecture in graph theory
by: Zhan, Xingzhi
Published: (2024)
by: Zhan, Xingzhi
Published: (2024)
A Fan-type condition involving bipartite independence number for hamiltonicity in graphs
by: Liu, Hongxi, et al.
Published: (2025)
by: Liu, Hongxi, et al.
Published: (2025)
Multigraphs with Unique Partition into Cycles
by: Cooper, Joshua, et al.
Published: (2025)
by: Cooper, Joshua, et al.
Published: (2025)
New type degree conditions for a graph to have a 2-factor
by: Kashima, Masaki
Published: (2025)
by: Kashima, Masaki
Published: (2025)
Ore-type condition for antidirected Hamilton cycles in oriented graphs
by: Cai, Junqing, et al.
Published: (2025)
by: Cai, Junqing, et al.
Published: (2025)
Cycles of consecutive lengths in $3$-connected graphs
by: Li, Chengli, et al.
Published: (2025)
by: Li, Chengli, et al.
Published: (2025)
The detour covering number and cummerbund covering number of a graph
by: Li, Chengli, et al.
Published: (2025)
by: Li, Chengli, et al.
Published: (2025)
The maximum number of paths of a given length in a nonhamiltonian graph
by: Li, Chengli, et al.
Published: (2026)
by: Li, Chengli, et al.
Published: (2026)
A note on the 2-Factor Hamiltonicity Conjecture
by: Gorsky, Maximilian, et al.
Published: (2024)
by: Gorsky, Maximilian, et al.
Published: (2024)
The minimum size of a $3$-connected locally nonforesty graph
by: Li, Chengli, et al.
Published: (2024)
by: Li, Chengli, et al.
Published: (2024)
The minimum size of a $k$-connected locally nonforesty graph
by: Li, Chengli, et al.
Published: (2025)
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)
by: Liu, Xining, et al.
Published: (2026)
On the girth and connectivity of cubic graphs with a unique longest cycle
by: Jooken, Jorik, et al.
Published: (2024)
by: Jooken, Jorik, et al.
Published: (2024)
Minimum degree edge-disjoint Hamilton cycles in random directed graphs
by: Ferber, Asaf, et al.
Published: (2025)
by: Ferber, Asaf, et al.
Published: (2025)
Arbitrary orientations of cycles in oriented graphs
by: Wang, Guanghui, et al.
Published: (2025)
by: Wang, Guanghui, et al.
Published: (2025)
Putting Tutte's counterexample to Tait's conjecture in perspective to hamiltonicity and non-hamiltonicity in certain planar cubic graphs
by: Fleischner, Herbert, et al.
Published: (2025)
by: Fleischner, Herbert, et al.
Published: (2025)
A sufficient condition for cubic 3-connected plane bipartite graphs to be hamiltonian
by: Florek, Jan
Published: (2023)
by: Florek, Jan
Published: (2023)
Two sufficient conditions for graphs to admit path factors
by: Zhou, Sizhong, et al.
Published: (2023)
by: Zhou, Sizhong, et al.
Published: (2023)
Paired $(n-1)$-to-$(n-1)$ disjoint path covers in bipartite transposition-like graphs
by: Coleman, Anna, et al.
Published: (2024)
by: Coleman, Anna, et al.
Published: (2024)
Every $2k$-connected $(P_2\cup kP_1)$-free graph with toughness greater than one is hamiltonian-connected
by: Liu, Feng
Published: (2025)
by: Liu, Feng
Published: (2025)
Note on Hamiltonicity of basis graphs of even delta-matroids
by: Kim, Donggyu, et al.
Published: (2023)
by: Kim, Donggyu, et al.
Published: (2023)
Hamiltonian cycles passing through matchings in $k$-ary $n$-cubes
by: Liao, Baolai, et al.
Published: (2024)
by: Liao, Baolai, et al.
Published: (2024)
An alternate form of Merino-Mička-Mütze's approach to a combinatorial generation problem of Knuth
by: Dejter, Italo J.
Published: (2024)
by: Dejter, Italo J.
Published: (2024)
Circuits through prescribed edges
by: Knappe, Paul, et al.
Published: (2018)
by: Knappe, Paul, et al.
Published: (2018)
Pancyclicity in Graph Families with the Ore-Type Condition
by: Li, Luyi, et al.
Published: (2026)
by: Li, Luyi, et al.
Published: (2026)
Hamiltonian Complete Number of Some Variants of Caterpillar Graphs
by: Adefokun, Tayo Charles, et al.
Published: (2022)
by: Adefokun, Tayo Charles, et al.
Published: (2022)
Minimum-Turn Tours of Even Polyominoes
by: Beluhov, Nikolai
Published: (2025)
by: Beluhov, Nikolai
Published: (2025)
Extending Thomassen's conjecture to directed graphs
by: Christoph, Micha, et al.
Published: (2025)
by: Christoph, Micha, et al.
Published: (2025)
Characterizing simplex graphs
by: Xie, Yan-Ting, et al.
Published: (2025)
by: Xie, Yan-Ting, et al.
Published: (2025)
Walecki tournaments with an arc that lies in a unique directed triangle
by: Morris, Joy
Published: (2024)
by: Morris, Joy
Published: (2024)
Counting Small Cycle Double Covers
by: Jooken, Jorik, et al.
Published: (2025)
by: Jooken, Jorik, et al.
Published: (2025)
Nonexistence of Whirling-Knight Tours at Half Coil Count for $n \equiv 4, 6 \pmod 8$
by: Li, Shisheng
Published: (2026)
by: Li, Shisheng
Published: (2026)
More relations between $λ$-labeling and Hamiltonian paths with emphasis on line graph of bipartite multigraphs
by: Zaker, Manouchehr
Published: (2021)
by: Zaker, Manouchehr
Published: (2021)
Minimal toughness in subclasses of weakly chordal graphs
by: Gollin, J. Pascal, et al.
Published: (2026)
by: Gollin, J. Pascal, et al.
Published: (2026)
Spectral conditions of pancyclicity for t-tough graphs
by: Benediktovich, Vladimir I.
Published: (2024)
by: Benediktovich, Vladimir I.
Published: (2024)
A combinatorial bound on the number of distinct eigenvalues of a graph
by: Allred, Sarah, et al.
Published: (2022)
by: Allred, Sarah, et al.
Published: (2022)
Similar Items
-
Every $2$-connected $[4, 2]$-graph of order at least seven contains a pancyclic edge
by: Li, Chengli, et al.
Published: (2025) -
The minimum size and maximum diameter of an edge-pancyclic graph of a given order
by: Li, Chengli, et al.
Published: (2024) -
On the Hamiltonicity, traceability and toughness of complements of line graphs
by: Mammoliti, Adam
Published: (2026) -
An updated survey on 2-Factors of Regular Graphs
by: Labbate, D., et al.
Published: (2024) -
A conjecture implying Thomassen's chord conjecture in graph theory
by: Zhan, Xingzhi
Published: (2024)