default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPetra Zigert
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j17]Simon Brezovnik, Zhongyuan Che, Niko Tratnik
, Petra Zigert Pletersek:
Outerplane bipartite graphs with isomorphic resonance graphs. Discret. Appl. Math. 343: 340-349 (2024)- 2023
- [j16]Simon Brezovnik, Matthias Dehmer, Niko Tratnik, Petra Zigert Pletersek:
Szeged and Mostar root-indices of graphs. Appl. Math. Comput. 442: 127736 (2023) - 2022
- [j15]Boris Furtula, Slavko Radenkovic, Izudin Redzepovic, Niko Tratnik, Petra Zigert Pletersek:
The generalized Zhang-Zhang polynomial of benzenoid systems - theory and applications. Appl. Math. Comput. 418: 126822 (2022) - [j14]Matthias Dehmer, Frank Emmert-Streib, Niko Tratnik, Petra Zigert Pletersek:
Szeged-like entropies of graphs. Appl. Math. Comput. 431: 127325 (2022) - 2020
- [j13]Simon Brezovnik, Niko Tratnik, Petra Zigert Pletersek:
Resonance graphs of catacondensed even ring systems. Appl. Math. Comput. 374: 125064 (2020)
2010 – 2019
- 2019
- [j12]Petra Zigert Pletersek:
The edge-Wiener index and the edge-hyper-Wiener index of phenylenes. Discret. Appl. Math. 255: 326-333 (2019) - 2018
- [j11]Niko Tratnik, Tomislav Doslic, Petra Zigert Pletersek:
Saturation number of lattice animals. Ars Math. Contemp. 15(1): 191-204 (2018) - 2017
- [j10]Niko Tratnik, Petra Zigert Pletersek:
Saturation number of nanotubes. Ars Math. Contemp. 12(2): 337-350 (2017) - 2016
- [j9]Niko Tratnik, Petra Zigert Pletersek:
Resonance graphs of fullerenes. Ars Math. Contemp. 11(2): 425-435 (2016) - 2014
- [j8]Kannan Balakrishnan, Bostjan Bresar, Manoj Changat, Sandi Klavzar, Aleksander Vesel, Petra Zigert Pletersek:
Equal opportunity networks, distance-balanced graphs, and Wiener game. Discret. Optim. 12: 150-154 (2014)
2000 – 2009
- 2009
- [j7]Khaled Salem, Sandi Klavzar, Aleksander Vesel, Petra Zigert:
The Clar formulas of a benzenoid system and the resonance graph. Discret. Appl. Math. 157(11): 2565-2569 (2009) - 2008
- [j6]Damir Vukicevic, Petra Zigert:
Binary coding of algebraic Kekulé structures of catacondensed benzenoid graphs. Appl. Math. Lett. 21(7): 712-716 (2008) - 2007
- [j5]Wilfried Imrich, Alenka Lipovec, Iztok Peterin, Petra Zigert:
Fast recognition of classes of almost-median graphs. Discret. Math. 307(3-5): 464-471 (2007) - 2002
- [j4]Sandi Klavzar, Petra Zigert:
A min-max result on catacondensed benzenoid graphs. Appl. Math. Lett. 15(3): 279-283 (2002) - [j3]Sandi Klavzar, Petra Zigert, Gunnar Brinkmann:
Resonance graphs of catacondensed even ring systems are median. Discret. Math. 253(1-3): 35-43 (2002) - 2001
- [j2]Sandi Klavzar, Aleksander Vesel, Petra Zigert, Ivan Gutman:
Binary Coding of Kekulé Structures of Catacondensed Benzenoid Hydrocarbons. Comput. Chem. 25(6): 569-575 (2001) - 2000
- [j1]Sandi Klavzar, Petra Zigert, Ivan Gutman:
An Algorithm for the Calculation of the Hyper-Wiener Index of Benzenoid Hydrocarbons. Comput. Chem. 24(2): 229-233 (2000)
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:
