Riste vSkrekovski

activity

20122022

most citedMapping sparse signed graphs to

(K_{2 k}, M)

3 citations · 3 across the 3 of their papers we have counts for

collaborators

4 papers

math.CO2022

On chromatic vertex stability of 3-chromatic graphs with maximum degree 4

Martin Knor, Mirko Petruševski, Riste Škrekovski

The (independent) chromatic vertex stability ($\ivs(G)$) $\vs(G)$ is the minimum size of (independent) set $S \subseteq V (G)$ such that $χ (G - S) = χ (G) - 1$ . In this paper we construct i…

math.CO2021★ 3 cited

Mapping sparse signed graphs to $(K_{2 k}, M)$

Reza Naserasr, Riste Škrekovski, Zhouningxin Wang +1

A homomorphism of a signed graph $(G, σ)$ to $(H, π)$ is a mapping of vertices and edges of $G$ to (respectively) vertices and edges of $H$ such that adjacencies, incidences and th…

math.CO2017

Lah numbers and Lindström's lemma

Ivica Martinjak, Riste Škrekovski

We provide a combinatorial interpretation of Lah numbers by means of planar networks. Henceforth, as a conesquence of Lindström's lemma, we conclude that the related Lah matrix pos…

math.CO2012

Euler's idoneal numbers and an inequality concerning minimal graphs with a prescribed number of spanning trees

Jernej Azarija, Riste Škrekovski

Let $α (n)$ be the least number $k$ for which there exists a simple graph with $k$ vertices having precisely $n \geq 3$ spanning trees. Similarly, define $β (n)$ as the least number…

On chromatic vertex stability of 3-chromatic graphs with maximum degree 4

Mapping sparse signed graphs to (K2k​,M)

Lah numbers and Lindström's lemma

Euler's idoneal numbers and an inequality concerning minimal graphs with a prescribed number of spanning trees

Mapping sparse signed graphs to $(K_{2 k}, M)$