default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTomislav Doslic
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j35]Tomislav Doslic, Mate Puljiz, Stjepan Sebek, Josip Zubrinic:
Complexity function of jammed configurations of Rydberg atoms. Ars Math. Contemp. 24(4): 4 (2024)- [j34]Tomislav Doslic, László Németh
, Luka Podrug:
Hosoya index of thorny polymers. Discret. Appl. Math. 343: 277-287 (2024) - [j33]Nasrin Dehgardi, Tomislav Doslic:
Lower bounds on the general first Zagreb index of graphs with low cyclomatic number. Discret. Appl. Math. 345: 52-61 (2024) - [j32]Tomislav Doslic, Mate Puljiz, Stjepan Sebek, Josip Zubrinic:
On a variant of Flory model. Discret. Appl. Math. 356: 269-292 (2024) - [j31]Tomislav Doslic, Luka Podrug:
Metallic cubes. Discret. Math. 347(4): 113851 (2024) - 2023
- [j30]Mahdieh Azari, Nasrin Dehgardi, Tomislav Doslic:
Lower bounds on the irregularity of trees and unicyclic graphs. Discret. Appl. Math. 324: 136-144 (2023) - 2022
- [j29]Tomislav Doslic, Meysam Taheri-Dehkordi, Gholam Hossein Fath-Tabar:
Shortest perfect pseudomatchings in fullerene graphs. Appl. Math. Comput. 424: 127026 (2022) - 2021
- [j28]Akbar Ali, Tomislav Doslic:
Mostar index: Results and perspectives. Appl. Math. Comput. 404: 126245 (2021) - [j27]Tomislav Doslic:
Restricted 2-extendability of (3, 6)-fullerenes. Discret. Appl. Math. 298: 1-6 (2021)
2010 – 2019
- 2019
- [j26]Tomislav Doslic:
Block allocation of a sequential resource. Ars Math. Contemp. 17(1): 79-88 (2019) - [j25]Tomislav Doslic, Ivica Martinjak, Riste Skrekovski:
Total positivity of Toeplitz matrices of recursive hypersequences. Ars Math. Contemp. 17(1): 125-139 (2019) - 2018
- [j24]Niko Tratnik, Tomislav Doslic, Petra Zigert Pletersek:
Saturation number of lattice animals. Ars Math. Contemp. 15(1): 191-204 (2018) - [j23]Damir Vukicevic, Shuang Zhao, Jelena Sedlar, Shou-Jun Xu, Tomislav Doslic:
Global forcing number for maximal matchings. Discret. Math. 341(3): 801-809 (2018) - 2017
- [j22]Farzaneh Falahati Nezhad, Mahdieh Azari, Tomislav Doslic:
Sharp bounds on the inverse sum indeg index. Discret. Appl. Math. 217: 185-195 (2017) - 2016
- [j21]Snjezana Majstorovic, Antoaneta Klobucar, Tomislav Doslic:
Domination Numbers Of m-Cactus Chains. Ars Comb. 125: 11-22 (2016) - [j20]Tomislav Doslic, Ivana Zubac:
Counting maximal matchings in linear polymers. Ars Math. Contemp. 11(2): 255-276 (2016) - [j19]Afshin Behmaram, Tomislav Doslic, Shmuel Friedland:
Matchings in m-generalized fullerene graphs. Ars Math. Contemp. 11(2): 301-313 (2016) - 2015
- [j18]Tomislav Doslic, Dieter Rautenbach:
Factor-critical graphs with the minimum number of near-perfect matchings. Discret. Math. 338(12): 2318-2319 (2015) - 2014
- [j17]Mohammad Ali Hosseinzadeh, Ali Iranmanesh, Tomislav Doslic:
On The Narumi-Katayama Index of Splice and Link of graphs. Electron. Notes Discret. Math. 45: 141-146 (2014) - [j16]Zahra Yarahmadi, Sirous Moradi, Tomislav Doslic:
Eccentric connectivity index of graphs with subdivided edges. Electron. Notes Discret. Math. 45: 167-176 (2014) - [j15]Tomislav Doslic:
Kepler-Bouwkamp Radius of Combinatorial Sequences. J. Integer Seq. 17(11): 14.11.3 (2014) - 2013
- [j14]Yaser Alizadeh, Ali Iranmanesh, Tomislav Doslic:
Additively weighted Harary index of some composite graphs. Discret. Math. 313(1): 26-34 (2013) - 2010
- [j13]Zahra Yarahmadi, Tomislav Doslic, Ali Reza Ashrafi:
The bipartite edge frustration of composite graphs. Discret. Appl. Math. 158(14): 1551-1558 (2010) - [j12]Ali Reza Ashrafi, Tomislav Doslic, Asma Hamzeh:
The Zagreb coindices of graph operations. Discret. Appl. Math. 158(15): 1571-1578 (2010) - [j11]Tomislav Doslic, Frode Måløy:
Chain hexagonal cacti: Matchings and independent sets. Discret. Math. 310(12): 1676-1690 (2010)
2000 – 2009
- 2008
- [j10]Tomislav Doslic:
Vertex-weighted Wiener polynomials for composite graphs. Ars Math. Contemp. 1(1): 66-80 (2008) - [j9]Tomislav Doslic, Darko Veljan:
Logarithmic behavior of some combinatorial sequences. Discret. Math. 308(11): 2182-2212 (2008) - [j8]Tomislav Doslic:
Counting perfect matchings in n-extendable graphs. Discret. Math. 308(11): 2297-2300 (2008) - 2007
- [j7]Damir Vukicevic, Tomislav Doslic:
Global forcing number of grid graphs. Australas. J Comb. 38: 47-62 (2007) - [j6]Tomislav Doslic, Damir Vukicevic:
Computing the bipartite edge frustration of fullerene graphs. Discret. Appl. Math. 155(10): 1294-1301 (2007) - [j5]Douglas J. Klein, Tomislav Doslic, Danail Bonchev:
Vertex-weightings for distance moments and thorny graphs. Discret. Appl. Math. 155(17): 2294-2302 (2007) - 2005
- [j4]Tomislav Doslic:
Mycielskians and matchings. Discuss. Math. Graph Theory 25(3): 261-266 (2005) - [j3]Tomislav Doslic:
Log-balanced combinatorial sequences. Int. J. Math. Math. Sci. 2005(4): 507-522 (2005) - 2004
- [j2]Tomislav Doslic, Dragutin Svrtan, Darko Veljan:
Enumerative aspects of secondary structures. Discret. Math. 285(1-3): 67-82 (2004) - 2002
- [j1]Tomislav Doslic:
On lower bounds on the number of perfect matchings in n-extendable bricks. Australas. J Comb. 26: 193-198 (2002)
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-11-25 23:44 CET 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:
