default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPouria Salehi Nowbandegani
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2022
[j14]Boris Brimkov, Jesse Geneson
, Alathea Jensen, Jordan Broussard, Pouria Salehi Nowbandegani:
Intersections and circuits in sets of line segments. J. Comb. Optim. 44(4): 2302-2323 (2022)- 2020
- [j13]Mark N. Ellingham, Pouria Salehi Nowbandegani, Songling Shan:
Toughness and prism-hamiltonicity of P4-free graphs. Discret. Appl. Math. 284: 201-206 (2020) - [j12]Mark N. Ellingham, Pouria Salehi Nowbandegani:
The Chvátal-Erdős condition for prism-Hamiltonicity. Discret. Math. 343(7): 111709 (2020) - 2019
- [j11]Haibo Wu, Colton Magnant, Pouria Salehi Nowbandegani, Suman Xia:
All partitions have small parts - Gallai-Ramsey numbers of bipartite graphs. Discret. Appl. Math. 254: 196-203 (2019) - [j10]Vincent E. Coll, Colton Magnant, Pouria Salehi Nowbandegani:
Degree sum and graph linkage with prescribed path lengths. Discret. Appl. Math. 257: 85-94 (2019) - 2018
- [j9]Colton Magnant, Daniel M. Martin, Pouria Salehi Nowbandegani:
Monochromatic Subgraphs in the Absence of a Properly Colored 4-Cycle. Graphs Comb. 34(6): 1147-1158 (2018) - [j8]Vincent E. Coll, Alexander Halperin, Colton Magnant, Pouria Salehi Nowbandegani:
Enomoto and Ota's Conjecture Holds for Large Graphs. Graphs Comb. 34(6): 1619-1635 (2018) - 2017
- [j7]Ronald J. Gould, Colton Magnant, Pouria Salehi Nowbandegani:
Placing Specified Vertices at Precise Locations on a Hamiltonian Cycle. Graphs Comb. 33(2): 369-385 (2017) - [j6]Robert Katic, Colton Magnant, Pouria Salehi Nowbandegani:
Forbidden Properly Edge-Colored Subgraphs that Force Large Highly Connected Monochromatic Subgraphs. Graphs Comb. 33(4): 969-979 (2017) - 2016
- [j5]Emily Chizmar, Colton Magnant, Pouria Salehi Nowbandegani:
Note on vertex and total proper connection numbers. AKCE Int. J. Graphs Comb. 13(2): 103-106 (2016) - [j4]Emily Chizmar, Colton Magnant, Pouria Salehi Nowbandegani:
Note on Semi-Linkage with Almost Prescribed Lengths in Large Graphs. Graphs Comb. 32(3): 881-886 (2016) - 2015
- [j3]Colton Magnant, Pouria Salehi Nowbandegani, Ivan Gutman:
Which tree has the smallest ABC index among trees with k leaves? Discret. Appl. Math. 194: 143-146 (2015) - [j2]Colton Magnant, Pouria Salehi Nowbandegani, Hua Wang:
Graphs obtained from collections of blocks. Electron. J. Graph Theory Appl. 3(1): 50-55 (2015) - 2014
- [j1]Khodakhast Bibak, Hossein Esfandiari, Pouria Salehi Nowbandegani, Mohammad Hassan Shirdareh Haghighi:
On the Erdös-Gyárfás conjecture in claw-free graphs. Discuss. Math. Graph Theory 34(3): 635-640 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-06 22:03 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
