Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: Erdős-Gyárfás conjecture

Sortuj według:

Ogranicz wyniki do:

Onq-Power Cycles in Cubic Graphs

100%

Bensmail J.

Discussiones Mathematicae Graph Theory

2017

tom 37

nr 1

211-220

In the context of a conjecture of Erdős and Gyárfás, we consider, for any q ≥ 2, the existence of q-power cycles (i.e., with length a power of q) in cubic graphs. We exhibit constructions showing that, for every q ≥ 3, there exist arbitrarily large cubic graphs with no q-power cycles. Concerning the remaining case q = 2 (which corresponds to the conjecture of Erdős and Gyárfás), we show that there exist arbitrarily large cubic graphs whose all 2-power cycles have length 4 only, or 8 only.

On the Erdős-Gyárfás Conjecture in Claw-Free Graphs

100%

Nowbandegani P. S., Esfandiari H., Haghighi M. H. S., Bibak K.

Discussiones Mathematicae Graph Theory

2014

tom 34

nr 3

635-640

The Erdős-Gyárfás conjecture states that every graph with minimum degree at least three has a cycle whose length is a power of 2. Since this conjecture has proven to be far from reach, Hobbs asked if the Erdős-Gyárfás conjecture holds in claw-free graphs. In this paper, we obtain some results on this question, in particular for cubic claw-free graphs

Ograniczanie wyników

2 Discussiones Mathematicae Graph Theory

1 Bensmail J.

1 Bibak K.

1 Esfandiari H.

1 Haghighi M. H. S.

1 Nowbandegani P. S.

1 2017

1 2014

Wyniki wyszukiwania

Onq-Power Cycles in Cubic Graphs

On the Erdős-Gyárfás Conjecture in Claw-Free Graphs