Simon Spacapan

According to our database1, Simon Spacapan authored at least 30 papers between 2005 and 2020.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
The domination number of plane triangulations.
J. Comb. Theory, Ser. B, 2020

2019
On 3-colorings of direct products of graphs.
Discuss. Math. Graph Theory, 2019

2018
The diameter of strong orientations of Cartesian products of graphs.
Discret. Appl. Math., 2018

2015
Maximum independent sets in direct products of cycles or trees with arbitrary graphs.
Discuss. Math. Graph Theory, 2015

The median game.
Discret. Optim., 2015

On disjoint hypercubes in Fibonacci cubes.
Discret. Appl. Math., 2015

2013
A characterization of the edge connectivity of direct products of graphs.
Discret. Math., 2013

A forbidden subgraph characterization of some graph classes using betweenness axioms.
Discret. Math., 2013

2012
Degenerate and star colorings of graphs on surfaces.
Eur. J. Comb., 2012

2011
On edge connectivity of direct products of graphs.
Inf. Process. Lett., 2011

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

2010
NZ-flows in strong products of graphs.
J. Graph Theory, 2010

Connectivity of Strong Products of Graphs.
Graphs Comb., 2010

2009
The Two-Coloring Number and Degenerate Colorings of Planar Graphs.
SIAM J. Discret. Math., 2009

Strongly distance-balanced graphs and graph products.
Eur. J. Comb., 2009

Broadcast domination of products of graphs.
Ars Comb., 2009

2008
Power Domination in Product Graphs.
SIAM J. Discret. Math., 2008

Coloring parameters for graphs on surfaces.
Electron. Notes Discret. Math., 2008

On acyclic colorings of direct produts.
Discuss. Math. Graph Theory, 2008

Connectivity of Cartesian products of graphs.
Appl. Math. Lett., 2008

On the connectivity of the direct product of graphs.
Australas. J Comb., 2008

Antimedian graphs.
Australas. J Comb., 2008

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

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

Edge-connectivity of strong products of graphs.
Discuss. Math. Graph Theory, 2007

2006
The Δ<sup>2</sup>-conjecture for L(2, 1)-labelings is true for direct and strong products of graphs.
IEEE Trans. Circuits Syst. II Express Briefs, 2006

Some results on total domination in direct products of graphs.
Discuss. Math. Graph Theory, 2006

An almost complete description of perfect codes in direct products of cycles.
Adv. Appl. Math., 2006

2005
Characterizing r-perfect codes in direct products of two and three cycles.
Inf. Process. Lett., 2005

Perfect codes in direct products of cycles.
Electron. Notes Discret. Math., 2005


  Loading...