Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Ajit Diwan"'
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 17 no.2, Iss Graph Theory (2015)
Let G denote a multigraph with edge set E(G), let µ(G) denote the maximum edge multiplicity in G, and let Pk denote the path on k vertices. Heinrich et al.(1999) showed that P4 decomposes a connected 4-regular graph G if and only if |E(G)| is divisi
Externí odkaz:
https://doaj.org/article/e0db430aee7d4cb594328e64d90028f7
Autor:
Ajit Diwan
Publikováno v:
Journal of Graph Theory. 101:142-160
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8076949885eb202697f490ff5bccafd7
https://doi.org/10.1002/jgt.22818
https://doi.org/10.1002/jgt.22818
Autor:
Tejal L. Patel, Bhargavi Ajit Diwan
Publikováno v:
International Journal of Reproduction, Contraception, Obstetrics and Gynecology. 11:1171
Background: Multifetal gestation is a high-risk pregnancy associated with increased maternal and fetal complications. The rate of multiple pregnancy has dramatically increased during the past decades, along with the diffusion of assisted reproduction
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ba54dc6a9b1dcddd88659b49b8f1912e
https://doi.org/10.18203/2320-1770.ijrcog20220899
https://doi.org/10.18203/2320-1770.ijrcog20220899