Perfect codes in direct products of cycles. - Simon Spacapan (Electron. Notes Discret. Math., 2005)

Characterizing r-perfect codes in direct products of two and three cycles. - Janja Jerebic; Sandi Klavzar; Simon Spacapan (Inf. Process. Lett., 2005)

An almost complete description of perfect codes in direct products of cycles. - Sandi Klavzar; Simon Spacapan; Janez Zerovnik (Adv. Appl. Math., 2006)

Some results on total domination in direct products of graphs. - Paul Dorbec; Sylvain Gravier; Sandi Klavzar; Simon Spacapan (Discuss. Math. Graph Theory, 2006)

The Δ2-conjecture for L(2, 1)-labelings is true for direct and strong products of graphs. - Sandi Klavzar; Simon Spacapan (IEEE Trans. Circuits Syst. II Express Briefs, 2006)

Edge-connectivity of strong products of graphs. - Bostjan Bresar; Simon Spacapan (Discuss. Math. Graph Theory, 2007)

Nonexistence of face-to-face four-dimensional tilings in the Lee metric. - Simon Spacapan (Eur. J. Comb., 2007)

Optimal Lee-Type Local Structures in Cartesian Products of Cycles and Paths. - Simon Spacapan (SIAM J. Discret. Math., 2007)

Antimedian graphs. - Kannan Balakrishnan; Manoj Changat; Sandi Klavzar; Joseph Mathews; Iztok Peterin; G. N. Prasanth; Simon Spacapan (Australas. J Comb., 2008)

On the connectivity of the direct product of graphs. - Bostjan Bresar; Simon Spacapan (Australas. J Comb., 2008)

Connectivity of Cartesian products of graphs. - Simon Spacapan (Appl. Math. Lett., 2008)

On acyclic colorings of direct produts. - Simon Spacapan; Aleksandra Tepeh (Discuss. Math. Graph Theory, 2008)

Coloring parameters for graphs on surfaces. - Bojan Mohar; Simon Spacapan (Electron. Notes Discret. Math., 2008)

Power Domination in Product Graphs. - Paul Dorbec; Michel Mollard; Sandi Klavzar; Simon Spacapan (SIAM J. Discret. Math., 2008)

Broadcast domination of products of graphs. - Bostjan Bresar; Simon Spacapan (Ars Comb., 2009)

Strongly distance-balanced graphs and graph products. - Kannan Balakrishnan; Manoj Changat; Iztok Peterin; Simon Spacapan; Primoz Sparl; Ajitha R. Subhamathi (Eur. J. Comb., 2009)

The Two-Coloring Number and Degenerate Colorings of Planar Graphs. - Hal A. Kierstead; Bojan Mohar; Simon Spacapan; Daqing Yang; Xuding Zhu (SIAM J. Discret. Math., 2009)

Connectivity of Strong Products of Graphs. - Simon Spacapan (Graphs Comb., 2010)

NZ-flows in strong products of graphs. - Wilfried Imrich; Iztok Peterin; Simon Spacapan; Cun-Quan Zhang (J. Graph Theory, 2010)

The k-independence number of direct products of graphs and Hedetniemi's conjecture. - Simon Spacapan (Eur. J. Comb., 2011)

On edge connectivity of direct products of graphs. - Xiang-Lan Cao; Spela Brglez; Simon Spacapan; Elkin Vumar (Inf. Process. Lett., 2011)

Degenerate and star colorings of graphs on surfaces. - Bojan Mohar; Simon Spacapan (Eur. J. Comb., 2012)

A forbidden subgraph characterization of some graph classes using betweenness axioms. - Manoj Changat; Anandavally K. Lakshmikuttyamma; Joseph Mathews; Iztok Peterin; Prasanth G. Narasimha-Shenoi; Geetha Seethakuttyamma; Simon Spacapan (Discret. Math., 2013)

A characterization of the edge connectivity of direct products of graphs. - Simon Spacapan (Discret. Math., 2013)

On disjoint hypercubes in Fibonacci cubes. - Sylvain Gravier; Michel Mollard; Simon Spacapan; Sara Sabrina Zemljic (Discret. Appl. Math., 2015)

The median game. - Manoj Changat; Divya Sindhu Lekha; Iztok Peterin; Ajitha R. Subhamathi; Simon Spacapan (Discret. Optim., 2015)

Maximum independent sets in direct products of cycles or trees with arbitrary graphs. - Tjasa Paj; Simon Spacapan (Discuss. Math. Graph Theory, 2015)

The diameter of strong orientations of Cartesian products of graphs. - Simon Spacapan (Discret. Appl. Math., 2018)

On 3-colorings of direct products of graphs. - Simon Spacapan (Discuss. Math. Graph Theory, 2019)

The domination number of plane triangulations. - Simon Spacapan (J. Comb. Theory B, 2020)

Optimal covering of the equidistant square grid network. - Tomislav Letnik; Stane Bozicnik; Simon Spacapan; Matej Mencinger (Discret. Appl. Math., 2021)

A counterexample to prism-hamiltonicity of 3-connected planar graphs. - Simon Spacapan (J. Comb. Theory B, 2021)

A proof of a conjecture on maximum Wiener index of oriented ladder graphs. - Tadeja Kraner Sumenjak; Simon Spacapan; Dasa Stesl (J. Appl. Math. Comput., 2021)

Separation of Cartesian products of graphs into several connected components by the removal of vertices. - Tjasa Paj Erker; Simon Spacapan (Discuss. Math. Graph Theory, 2022)

Polyhedra without cubic vertices are prism-hamiltonian. - Simon Spacapan (J. Graph Theory, 2024)