1997
DOI: 10.1016/s0166-218x(97)00032-2
|View full text |Cite
|
Sign up to set email alerts
|

A sufficient condition for all short cycles

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
24
0

Year Published

1998
1998
2021
2021

Publication Types

Select...
8
1

Relationship

1
8

Authors

Journals

citations
Cited by 39 publications
(24 citation statements)
references
References 3 publications
0
24
0
Order By: Relevance
“…In [69], Brandt generalized Theorem 4.10 and showed that the same size without the hamiltonicity requirement is sufficient for a graph to be weakly pancyclic with girth 3.…”
Section: Weakly Pancyclic Graphsmentioning
confidence: 99%
“…In [69], Brandt generalized Theorem 4.10 and showed that the same size without the hamiltonicity requirement is sufficient for a graph to be weakly pancyclic with girth 3.…”
Section: Weakly Pancyclic Graphsmentioning
confidence: 99%
“…[2,[5][6][7]). Suppose G is a graph with girth gðGÞ and circumference cðGÞ: An interval ½a; b of integers with gðGÞ a b cðGÞ is said to be a domain of pancyclicity of G if for every t with a t b there is a cycle C t 2 G:…”
Section: Domains Of Pancyclicitymentioning
confidence: 99%
“…Further, an additional goal is to characterize the extermal graphs G(n; F) where f (n; F) is attained. This problem has been studied extensively by a number of authors [4,5,7,8,9]. In 1998, Jia proved that …”
Section: Introductionmentioning
confidence: 99%