Pouria Salehi Nowbandegani

Orcid: 0000-0002-3659-0765

According to our database1, Pouria Salehi Nowbandegani authored at least 15 papers between 2014 and 2026.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Ramsey numbers avoiding properly colored cycles.
Discret. Appl. Math., 2026

2022
Intersections and circuits in sets of line segments.
J. Comb. Optim., 2022

2020
The Chvátal-Erdős condition for prism-Hamiltonicity.
Discret. Math., 2020

Toughness and prism-hamiltonicity of P4-free graphs.
Discret. Appl. Math., 2020

2019
All partitions have small parts - Gallai-Ramsey numbers of bipartite graphs.
Discret. Appl. Math., 2019

Degree sum and graph linkage with prescribed path lengths.
Discret. Appl. Math., 2019

2018
Monochromatic Subgraphs in the Absence of a Properly Colored 4-Cycle.
Graphs Comb., 2018

Enomoto and Ota's Conjecture Holds for Large Graphs.
Graphs Comb., 2018

2017
Forbidden Properly Edge-Colored Subgraphs that Force Large Highly Connected Monochromatic Subgraphs.
Graphs Comb., 2017

Placing Specified Vertices at Precise Locations on a Hamiltonian Cycle.
Graphs Comb., 2017

2016
Note on Semi-Linkage with Almost Prescribed Lengths in Large Graphs.
Graphs Comb., 2016

Note on vertex and total proper connection numbers.
AKCE Int. J. Graphs Comb., 2016

2015
Graphs obtained from collections of blocks.
Electron. J. Graph Theory Appl., 2015

Which tree has the smallest ABC index among trees with k leaves?
Discret. Appl. Math., 2015

2014
On the Erdös-Gyárfás conjecture in claw-free graphs.
Discuss. Math. Graph Theory, 2014


  Loading...