default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDM. Amin Bahmanian
Person information
- affiliation: Illinois State University, Department of Mathematics, Normal, IL, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j15]Amin Bahmanian
:
Symmetric Layer-Rainbow Colorations of Cubes. SIAM J. Discret. Math. 37(4): 2617-2625 (2023)- 2022
- [j14]Amin Bahmanian:
Ryser's Theorem for ρ-Latin rectangles. J. Comb. Theory A 190: 105632 (2022) - [j13]Amin Bahmanian, Anna Johnsen, Stefan Napirata:
Embedding connected factorizations. J. Comb. Theory B 155: 358-373 (2022) - [i10]Amin Bahmanian:
On Factors with Prescribed Degrees in Bipartite Graphs. CoRR abs/2203.12470 (2022) - [i9]Amin Bahmanian:
Symmetric Layer-Rainbow Colorations of Cubes. CoRR abs/2205.02210 (2022) - [i8]Amin Bahmanian:
Ryser's Theorem for Symmetric ρ-latin Squares. CoRR abs/2209.06401 (2022) - [i7]Amin Bahmanian, Anna Johnsen:
Embedding Irregular Colorings into Connected Factorizations. CoRR abs/2209.06402 (2022) - [i6]Amin Bahmanian:
On Layer-Rainbow Latin Cubes Containing Layer-Rainbow Latin Cubes. CoRR abs/2209.06404 (2022) - 2021
- [j12]Amin Bahmanian, Sadegheh Haghshenas:
On regular set systems containing regular subsystems. Eur. J. Comb. 98: 103393 (2021) - [i5]Amin Bahmanian:
Extending Edge-colorings of Complete Hypergraphs into Regular Colorings. CoRR abs/2102.02862 (2021) - [i4]Amin Bahmanian:
Factorizations of Complete Multipartite Hypergraphs. CoRR abs/2102.02869 (2021) - 2020
- [j11]M. Amin Bahmanian, Sadegheh Haghshenas:
Extending regular edge-colorings of complete hypergraphs. J. Graph Theory 94(1): 59-74 (2020) - [i3]Amin Bahmanian:
Connected Fair Detachments of Hypergraphs. CoRR abs/2009.09674 (2020) - [i2]M. Amin Bahmanian, Sadegheh Haghshenas:
On Regular Set Systems Containing Regular Subsystems. CoRR abs/2009.10597 (2020)
2010 – 2019
- 2019
- [j10]M. Amin Bahmanian:
Extending edge-colorings of complete hypergraphs into regular colorings. J. Graph Theory 90(4): 547-560 (2019) - [i1]M. Amin Bahmanian, Mateja Sajna:
Decomposing complete equipartite multigraphs into cycles of variable lengths: the amalgamation-detachment approach. CoRR abs/1909.09644 (2019) - 2018
- [j9]M. Amin Bahmanian, Mike Newman:
Extending Factorizations of Complete Uniform Hypergraphs. Comb. 38(6): 1309-1335 (2018) - 2017
- [j8]M. Amin Bahmanian, Mateja Sajna:
Quasi-Eulerian Hypergraphs. Electron. J. Comb. 24(3): 3 (2017) - [j7]M. Amin Bahmanian:
Factorizations of complete multipartite hypergraphs. Discret. Math. 340(2): 46-50 (2017) - 2016
- [j6]M. Amin Bahmanian, Mike Newman:
Embedding Factorizations for 3-Uniform Hypergraphs II: $r$-Factorizations into $s$-Factorizations. Electron. J. Comb. 23(2): 2 (2016) - 2014
- [j5]M. Amin Bahmanian:
Connected Baranyai's theorem. Comb. 34(2): 129-138 (2014) - 2013
- [j4]M. Amin Bahmanian, C. A. Rodger:
Embedding an Edge-colored K(a (p); λ, μ) into a Hamiltonian Decomposition of K(a (p+r); λ, μ). Graphs Comb. 29(4): 747-755 (2013) - [j3]M. Amin Bahmanian, Christopher A. Rodger:
Embedding Factorizations for 3-Uniform Hypergraphs. J. Graph Theory 73(2): 216-224 (2013) - 2012
- [j2]M. Amin Bahmanian:
Detachments of Hypergraphs I: The Berge-Johnson Problem. Comb. Probab. Comput. 21(4): 483-495 (2012) - [j1]M. Amin Bahmanian, C. A. Rodger:
Multiply balanced edge colorings of multigraphs. J. Graph Theory 70(3): 297-317 (2012)
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:22 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:
