On k-Path Pancyclic Graphs
For integers k and n with 2 ≤ k ≤ n − 1, a graph G of order n is k-path pancyclic if every path P of order k in G lies on a cycle of every length from k + 1 to n. Thus a 2-path pancyclic graph is edge-pancyclic. In this paper, we present sufficient conditions for graphs to be k-path pancyclic. For a...
Spremljeno u:
| Glavni autori: | , |
|---|---|
| Format: | Artigo |
| Jezik: | Inglês |
| Izdano: |
University of Zielona Góra
2015-05-01
|
| Serija: | Discussiones Mathematicae Graph Theory |
| Teme: | |
| Online pristup: | https://doi.org/10.7151/dmgt.1795 |
| Oznake: |
Bez oznaka, Budi prvi tko označuje ovaj zapis!
|