#### Filter Results:

- Full text PDF available (2)

#### Publication Year

2014

2017

- This year (2)
- Last 5 years (6)
- Last 10 years (6)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Colton Magnant, Pouria Salehi Nowbandegani, Ivan Gutman
- Discrete Applied Mathematics
- 2015

- Colton Magnant, Pouria Salehi Nowbandegani, Hua Wang
- EJGTA
- 2015

- Emily Chizmar, Colton Magnant, Pouria Salehi Nowbandegani
- Graphs and Combinatorics
- 2016

- Robert Katic, Colton Magnant, Pouria Salehi Nowbandegani
- Graphs and Combinatorics
- 2017

- Ronald J. Gould, Colton Magnant, Pouria Salehi Nowbandegani
- Graphs and Combinatorics
- 2017

Sharp minimum degree and degree sum conditions are proven for the existence of a Hamiltonian cycle passing through specified vertices with prescribed distances between them in large graphs.

- Khodakhast Bibak, Hossein Esfandiari, Pouria Salehi Nowbandegani, Mohammad Hassan Shirdareh Haghighi
- Discussiones Mathematicae Graph Theory
- 2014

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.

- ‹
- 1
- ›