default search action
Elkin Vumar
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
- [j23]Long Tang, Elkin Vumar:
A note on cycles in locally Hamiltonian and locally Hamilton-connected graphs. Discuss. Math. Graph Theory 40(1): 77-84 (2020)
2010 – 2019
- 2019
- [j22]Christoph Brause, Bert Randerath, Ingo Schiermeyer, Elkin Vumar:
On the chromatic number of 2K2-free graphs. Discret. Appl. Math. 253: 14-24 (2019) - [j21]Xuepeng Cai, Elkin Vumar:
The super connectivity of folded crossed cubes. Inf. Process. Lett. 142: 52-56 (2019) - [j20]Eminjan Sabir, Aygul Mamut, Elkin Vumar:
The extra connectivity of the enhanced hypercubes. Theor. Comput. Sci. 799: 22-31 (2019) - 2018
- [j19]Christoph Brause, Michael A. Henning, Kenta Ozeki
, Ingo Schiermeyer, Elkin Vumar:
On upper bounds for the independent transversal domination number. Discret. Appl. Math. 236: 66-72 (2018) - 2014
- [j18]Xiaoling Ma, Elkin Vumar:
Neighborhood Union Conditions for Hamiltonicity of P 3-Dominated Graphs. Graphs Comb. 30(6): 1499-1511 (2014) - [j17]Eminjan Sabir, Elkin Vumar:
Spanning Connectivity of the Power of a Graph and Hamilton-Connected Index of a Graph. Graphs Comb. 30(6): 1551-1563 (2014) - [j16]Xiang-Lan Cao, Elkin Vumar:
Super Edge connectivity of Kronecker Products of graphs. Int. J. Found. Comput. Sci. 25(1): 59-66 (2014) - 2012
- [j15]Metrose Metsidik, Elkin Vumar:
Distance-Dominating Cycles in P3-Dominated Graphs. Ars Comb. 105: 387-393 (2012) - [j14]Hong Bian, Xiaoling Ma, Elkin Vumar, Haizheng Yu:
The Wiener-type indices of the corona of two graphs. Ars Comb. 107: 193-199 (2012) - 2011
- [j13]Fengli Yang, Elkin Vumar:
A note on a cycle partition problem. Appl. Math. Lett. 24(7): 1181-1184 (2011) - [j12]Xiang-Lan Cao, Spela Brglez
On edge connectivity of direct products of graphs. Inf. Process. Lett. 111(18): 899-902 (2011) - 2010
- [j11]Marhaba Hoji, Zhaoyang Luo, Elkin Vumar:
Wiener and vertex PI indices of Kronecker products of graphs. Discret. Appl. Math. 158(16): 1848-1855 (2010) - [j10]Metrose Metsidik, Elkin Vumar:
Toughness and Matching Extension in P3{\mathcal{P}_3}-Dominated Graphs. Graphs Comb. 26(3): 425-432 (2010)
2000 – 2009
- 2009
- [j9]Raxida Guji, Elkin Vumar:
A note on the connectivity of Kronecker products of graphs. Appl. Math. Lett. 22(9): 1360-1363 (2009) - [j8]Aygul Mamut, Sawut Awut, Elkin Vumar:
Circumferences of 2-connected quasi-claw-free graphs. Ars Comb. 91 (2009) - [j7]Hajo Broersma
On hamiltonicity of P 3-dominated graphs. Math. Methods Oper. Res. 69(2): 297-306 (2009) - 2008
- [j6]Metrose Metsidik, Elkin Vumar:
Edge vulnerability parameters of bisplit graphs. Comput. Math. Appl. 56(7): 1741-1747 (2008) - [j5]Jiangyan Guo, Elkin Vumar:
On the Circumference of 2-Connected P3\mathcal{P}_{3}-Dominated Graphs. Graphs Comb. 24(5): 443-451 (2008) - [j4]Aygul Mamut, Elkin Vumar:
Vertex vulnerability parameters of Kronecker products of complete graphs. Inf. Process. Lett. 106(6): 258-262 (2008) - 2007
- [c2]Jiangyan Guo, Elkin Vumar:
The Vertex-Neighbor-Integrity of Digraphs. International Conference on Computational Science (3) 2007: 370-376 - 2006
- [j3]Elkin Vumar:
On the Circumference of 3-Connected Quasi-Claw-Free Graphs. Graphs Comb. 22(2): 271-282 (2006) - 2005
- [j2]Elkin Vumar, Heinz Adolf Jung:
Some degree bounds for the circumference of graphs. Discret. Math. 299(1-3): 311-334 (2005) - [j1]Heinz Adolf Jung, Elkin Vumar:
Degree bounds for the circumference of 3-connected graphs. J. Graph Theory 50(1): 55-78 (2005) - [c1]Aygul Mamut, Elkin Vumar:
A Note on the Integrity of Middle Graphs. CJCDGCGT 2005: 130-134
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-10-07 21:15 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: