Остановите войну!
for scientists:
default search action
Theodore Molla
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j21]Beka Ergemlidze, Theodore Molla:
Transversal Ck-factors in subgraphs of the balanced blow-up of Ck. Comb. Probab. Comput. 31(6): 1031-1047 (2022) - [j20]Theodore Molla, Michael Santana:
Disjoint cycles in graphs with restricted independence number. Discret. Appl. Math. 320: 95-105 (2022) - [j19]Louis DeBiasio, Ryan R. Martin, Theodore Molla:
Powers of Hamiltonian cycles in multipartite graphs. Discret. Math. 345(4): 112747 (2022) - 2021
- [j18]Andrzej Czygrinow, Theodore Molla, Brendan Nagle, Roy Oursler:
On odd rainbow cycles in edge-colored graphs. Eur. J. Comb. 94: 103316 (2021) - [j17]Louis DeBiasio, Allan Lo, Theodore Molla, Andrew Treglown:
Transitive Tournament Tilings in Oriented Graphs with Large Minimum Total Degree. SIAM J. Discret. Math. 35(1): 250-266 (2021) - 2020
- [j16]Theodore Molla, Michael Santana, Elyse Yeager:
Disjoint cycles and chorded cycles in a graph with given minimum degree. Discret. Math. 343(6): 111837 (2020)
2010 – 2019
- 2019
- [j15]Lina Li, Theodore Molla:
Cyclic Triangle Factors in Regular Tournaments. Electron. J. Comb. 26(4): 4 (2019) - [j14]József Balogh, Theodore Molla:
Long rainbow cycles and Hamiltonian cycles using many colors in properly edge-colored complete graphs. Eur. J. Comb. 79: 140-151 (2019) - 2018
- [j13]József Balogh, Andrew McDowell, Theodore Molla, Richard Mycroft:
Triangle-Tilings in Graphs Without Large Independent Sets. Comb. Probab. Comput. 27(4): 449-474 (2018) - 2017
- [j12]Catherine Erbes, Theodore Molla, S. Mousley, Michael Santana:
Spanning trees with leaf distance at least d. Discret. Math. 340(6): 1412-1418 (2017) - [j11]Theodore Molla, Michael Santana, Elyse Yeager:
A Refinement of Theorems on Vertex-Disjoint Chorded Cycles. Graphs Comb. 33(1): 181-201 (2017) - [j10]József Balogh, Allan Lo, Theodore Molla:
Transitive triangle tilings in oriented graphs. J. Comb. Theory B 124: 64-87 (2017) - 2016
- [j9]Jessica De Silva, Theodore Molla, Florian Pfender, Troy Retter, Michael Tait:
Increasing Paths in Edge-Ordered Graphs: The Hypercube and Random Graph. Electron. J. Comb. 23(2): 2 (2016) - [j8]József Balogh, Theodore Molla, Maryam Sharifzadeh:
Triangle factors of graphs without large independent sets and of weighted graphs. Random Struct. Algorithms 49(4): 669-693 (2016) - 2015
- [j7]Louis DeBiasio, Theodore Molla:
Semi-Degree Threshold for Anti-Directed Hamiltonian Cycles. Electron. J. Comb. 22(4): 4 (2015) - [j6]Andrzej Czygrinow, Louis DeBiasio, Hal A. Kierstead, Theodore Molla:
An Extension of the Hajnal-Szemerédi Theorem to Directed Graphs. Comb. Probab. Comput. 24(5): 754-773 (2015) - [j5]Louis DeBiasio, Daniela Kühn, Theodore Molla, Deryk Osthus, Amelia Taylor:
Arbitrary Orientations of Hamilton Cycles in Digraphs. SIAM J. Discret. Math. 29(3): 1553-1584 (2015) - 2014
- [j4]Andrzej Czygrinow, Hal A. Kierstead, Theodore Molla:
On directed versions of the Corrádi-Hajnal corollary. Eur. J. Comb. 42: 1-14 (2014) - [j3]Andrzej Czygrinow, Theodore Molla:
Tight Codegree Condition for the Existence of Loose Hamilton Cycles in 3-Graphs. SIAM J. Discret. Math. 28(1): 67-76 (2014) - 2013
- [j2]Louis DeBiasio, Theodore Molla:
Semi-degree threshold for anti-directed Hamiltonian cycles. Electron. Notes Discret. Math. 43: 195-200 (2013) - 2011
- [j1]Hao Fan, Hal A. Kierstead, Guizhen Liu, Theodore Molla, Jianliang Wu, Xin Zhang:
A note on relaxed equitable coloring of graphs. Inf. Process. Lett. 111(21-22): 1062-1066 (2011)
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-06-10 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint