default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSimon Spacapan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j34]Tjasa Paj Erker, Simon Spacapan:
Separation of Cartesian products of graphs into several connected components by the removal of vertices. Discuss. Math. Graph Theory 42(3): 905-920 (2022)- 2021
- [j33]Tomislav Letnik
, Stane Bozicnik, Simon Spacapan, Matej Mencinger:
Optimal covering of the equidistant square grid network. Discret. Appl. Math. 296: 85-89 (2021) - [j32]Tadeja Kraner Sumenjak, Simon Spacapan, Dasa Stesl:
A proof of a conjecture on maximum Wiener index of oriented ladder graphs. J. Appl. Math. Comput. 67(1-2): 481-493 (2021) - [j31]Simon Spacapan:
A counterexample to prism-hamiltonicity of 3-connected planar graphs. J. Comb. Theory B 146: 364-371 (2021) - 2020
- [j30]Simon Spacapan:
The domination number of plane triangulations. J. Comb. Theory B 143: 42-64 (2020)
2010 – 2019
- 2019
- [j29]Simon Spacapan:
On 3-colorings of direct products of graphs. Discuss. Math. Graph Theory 39(2): 391-413 (2019) - 2018
- [j28]Simon Spacapan:
The diameter of strong orientations of Cartesian products of graphs. Discret. Appl. Math. 247: 116-121 (2018) - 2015
- [j27]Sylvain Gravier, Michel Mollard, Simon Spacapan, Sara Sabrina Zemljic:
On disjoint hypercubes in Fibonacci cubes. Discret. Appl. Math. 190-191: 50-55 (2015) - [j26]Manoj Changat, Divya Sindhu Lekha, Iztok Peterin, Ajitha R. Subhamathi, Simon Spacapan:
The median game. Discret. Optim. 17: 80-88 (2015) - [j25]Tjasa Paj, Simon Spacapan:
Maximum independent sets in direct products of cycles or trees with arbitrary graphs. Discuss. Math. Graph Theory 35(4): 675-688 (2015) - 2013
- [j24]Manoj Changat, Anandavally K. Lakshmikuttyamma, Joseph Mathews, Iztok Peterin, Prasanth G. Narasimha-Shenoi, Geetha Seethakuttyamma, Simon Spacapan:
A forbidden subgraph characterization of some graph classes using betweenness axioms. Discret. Math. 313(8): 951-958 (2013) - [j23]Simon Spacapan:
A characterization of the edge connectivity of direct products of graphs. Discret. Math. 313(11): 1385-1393 (2013) - 2012
- [j22]Bojan Mohar, Simon Spacapan:
Degenerate and star colorings of graphs on surfaces. Eur. J. Comb. 33(3): 340-349 (2012) - 2011
- [j21]Simon Spacapan:
The k-independence number of direct products of graphs and Hedetniemi's conjecture. Eur. J. Comb. 32(8): 1377-1383 (2011) - [j20]Xiang-Lan Cao, Spela Brglez, Simon Spacapan, Elkin Vumar:
On edge connectivity of direct products of graphs. Inf. Process. Lett. 111(18): 899-902 (2011) - 2010
- [j19]Simon Spacapan:
Connectivity of Strong Products of Graphs. Graphs Comb. 26(3): 457-467 (2010) - [j18]Wilfried Imrich, Iztok Peterin, Simon Spacapan, Cun-Quan Zhang:
NZ-flows in strong products of graphs. J. Graph Theory 64(4): 267-276 (2010)
2000 – 2009
- 2009
- [j17]Bostjan Bresar, Simon Spacapan:
Broadcast domination of products of graphs. Ars Comb. 92 (2009) - [j16]Kannan Balakrishnan, Manoj Changat, Iztok Peterin, Simon Spacapan, Primoz Sparl, Ajitha R. Subhamathi:
Strongly distance-balanced graphs and graph products. Eur. J. Comb. 30(5): 1048-1053 (2009) - [j15]Hal A. Kierstead, Bojan Mohar, Simon Spacapan, Daqing Yang, Xuding Zhu:
The Two-Coloring Number and Degenerate Colorings of Planar Graphs. SIAM J. Discret. Math. 23(3): 1548-1560 (2009) - 2008
- [j14]Bostjan Bresar, Simon Spacapan:
On the connectivity of the direct product of graphs. Australas. J Comb. 41: 45-56 (2008) - [j13]Kannan Balakrishnan, Manoj Changat, Sandi Klavzar, Joseph Mathews, Iztok Peterin, G. N. Prasanth, Simon Spacapan:
Antimedian graphs. Australas. J Comb. 41: 159-170 (2008) - [j12]Simon Spacapan:
Connectivity of Cartesian products of graphs. Appl. Math. Lett. 21(7): 682-685 (2008) - [j11]Simon Spacapan, Aleksandra Tepeh:
On acyclic colorings of direct produts. Discuss. Math. Graph Theory 28(2): 323-333 (2008) - [j10]Bojan Mohar, Simon Spacapan:
Coloring parameters for graphs on surfaces. Electron. Notes Discret. Math. 31: 281-286 (2008) - [j9]Paul Dorbec, Michel Mollard, Sandi Klavzar, Simon Spacapan:
Power Domination in Product Graphs. SIAM J. Discret. Math. 22(2): 554-567 (2008) - 2007
- [j8]Bostjan Bresar, Simon Spacapan:
Edge-connectivity of strong products of graphs. Discuss. Math. Graph Theory 27(2): 333-343 (2007) - [j7]Simon Spacapan:
Nonexistence of face-to-face four-dimensional tilings in the Lee metric. Eur. J. Comb. 28(1): 127-133 (2007) - [j6]Simon Spacapan:
Optimal Lee-Type Local Structures in Cartesian Products of Cycles and Paths. SIAM J. Discret. Math. 21(3): 750-762 (2007) - 2006
- [j5]Sandi Klavzar, Simon Spacapan, Janez Zerovnik:
An almost complete description of perfect codes in direct products of cycles. Adv. Appl. Math. 37(1): 2-18 (2006) - [j4]Paul Dorbec, Sylvain Gravier, Sandi Klavzar, Simon Spacapan:
Some results on total domination in direct products of graphs. Discuss. Math. Graph Theory 26(1): 103-112 (2006) - [j3]Sandi Klavzar, Simon Spacapan:
The Δ2-conjecture for L(2, 1)-labelings is true for direct and strong products of graphs. IEEE Trans. Circuits Syst. II Express Briefs 53-II(4): 274-277 (2006) - 2005
- [j2]Simon Spacapan:
Perfect codes in direct products of cycles. Electron. Notes Discret. Math. 22: 201-205 (2005) - [j1]Janja Jerebic, Sandi Klavzar, Simon Spacapan:
Characterizing r-perfect codes in direct products of two and three cycles. Inf. Process. Lett. 94(1): 1-6 (2005)
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:25 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:
