Simon Špacapan

activity

20082024

most citedPolyhedra without cubic vertices are prism-hamiltonian

1 citations · 1 across the 5 of their papers we have counts for

collaborators

8 papers

math.CO2024

Spanning weakly even trees of graphs

Jiangdong Ai, M. N. Ellingham, Zhipeng Gao +5

Let $G$ be a graph (with multiple edges allowed) and let $T$ be a tree in $G$ . We say that $T$ is $even$ if every leaf of $T$ belongs to the same part of the bipartition o…

math.CO2022

A note on Vizing's conjecture

Simon Špacapan

Let $γ (G)$ denote the domination number of graph $G$ . Let $G$ and $H$ be graphs and $G □ H$ their Cartesian product. For $h \in V (H)$ define $G_{h} = {(g, h) ∣ g \in V (G)}$ and call…

math.CO2021★ 1 cited

Polyhedra without cubic vertices are prism-hamiltonian

Simon Špacapan

The prism over a graph $G$ is the Cartesian product of $G$ with the complete graph on two vertices. A graph $G$ is prism-hamiltonian if the prism over $G$ is hamiltonian. We prove…

math.CO2019

A counterexample to prism-hamiltonicity of 3-connected planar graphs

Simon Spacapan

The prism over a graph $G$ is the Cartesian product of $G$ with the complete graph $K_{2}$ . A graph $G$ is hamiltonian if there exists a spanning cycle in $G$ , and $G$ is prism-hamil…

math.CO2018

The domination number of plane triangulations

Simon Spacapan

We introduce a class of plane graphs called weak near-triangulations, and prove that this class is closed under certain graph operations. Then we use the properties of weak near-tr…

math.CO2015

On Disjoint hypercubes in Fibonacci cubes

Sylvain Gravier, Michel Mollard, Simon Spacapan +1

The {\em Fibonacci cube} of dimension $n$ , denoted as $Γ_n$ , is the subgraph of $n$ -cube $Q_n$ induced by vertices with no consecutive 1's. We study the maximum number of disjoin…