On the Erdős-Gyárfás Conjecture in Claw-Free Graphs
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 thi...
| Príomhchruthaitheoirí: | , , , |
|---|---|
| Formáid: | Alt |
| Teanga: | English |
| Foilsithe / Cruthaithe: |
University of Zielona Góra
2014-08-01
|
| Sraith: | Discussiones Mathematicae Graph Theory |
| Ábhair: | |
| Rochtain ar líne: | https://doi.org/10.7151/dmgt.1732 |