14 citations · 26 across the 14 of their papers we have counts for
15 papers · 1 filter
A note on vertex-critical induced subgraphs of shift graphs
Tomáš Kaiser, Matěj Stehlík, Riste Škrekovski +1
Shift graphs, introduced by Erdős and Hajnal in 1964, form one of the simplest known non-recursive constructions of triangle-free graphs with arbitrarily large chromatic number. In…
Degree-choosability of proper conflict-free list coloring of sparse graphs
Masaki Kashima, Riste Škrekovski, Rongxing Xu
Given a graph and a mapping , an -list assignment of is a function that maps each to a set of at least colors. For an -list…
The odd independence number of graphs, II: Finite and infinite grids and chessboard graphs
Yair Caro, Mirko Petruševski, Riste Škrekovski +1
An odd independent set in a graph is an independent set of vertices such that, for every vertex , either or $|N(v) \cap…
The odd independence number of graphs, I: Foundations and classical classes
Yair Caro, Mirko Petruševski, Riste Škrekovski +1
An odd independent set in a graph is an independent set of vertices such that, for every vertex , either or $|N(v) \cap…
Some results on -irregularity
Slobodan Filipovski, Darko Dimitrov, Martin Knor +1
The -irregularity (or sigma total index) is a graph invariant which is defined as where denotes the degree of…
Proper Z4 x Z2-colorings: structural characterization with application to some snarks
Jelena Sedlar, Riste Škrekovski
A proper abelian coloring of a cubic graph G by a finite abelian group A is any proper edge-coloring of G by the non-zero elements of A such that the sum of the colors of the three…
Normal 5-edge coloring of some more snarks superpositioned by the Petersen graph
Jelena Sedlar, Riste Škrekovski
A normal 5-edge-coloring of a cubic graph is a coloring such that for every edge the number of distinct colors incident to its end-vertices is 3 or 5 (and not 4). The well known Pe…
A note on the locally irregular edge colorings of cacti
Jelena Sedlar, Riste Škrekovski
A graph is locally irregular if the degrees of the end-vertices of every edge are distinct. An edge coloring of a graph G is locally irregular if every color induces a locally irre…
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 such that . In this paper we construct i…
Colorings with neighborhood parity condition
Mirko Petruševski, Riste Škrekovski
In this short paper, we introduce a new vertex coloring whose motivation comes from our series on odd edge-colorings of graphs. A proper vertex coloring of graph is said to…
Mapping sparse signed graphs to
Reza Naserasr, Riste Škrekovski, Zhouningxin Wang +1
A homomorphism of a signed graph to is a mapping of vertices and edges of to (respectively) vertices and edges of such that adjacencies, incidences and th…
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…
Sandwiching saturation number of fullerene graphs
Vesna Andova, František Kardoš, Riste Škrekovski
The saturation number of a graph is the cardinality of any smallest maximal matching of , and it is denoted by . Fullerene graphs are cubic planar graphs with exactly…
Improved bound on facial parity edge coloring
Borut Lužar, Riste Škrekovski
A facial parity edge coloring of a 2-edge connected plane graph is an edge coloring where no two consecutive edges of a facial walk of any face receive the same color. Additionally…
Euler's idoneal numbers and an inequality concerning minimal graphs with a prescribed number of spanning trees
Jernej Azarija, Riste Škrekovski
Let be the least number for which there exists a simple graph with vertices having precisely spanning trees. Similarly, define as the least number…