Mirko Petruvsevski

collaborators

3 papers

math.CO2026

The odd independence number of graphs, I: Foundations and classical classes

Yair Caro, Mirko PetruÅ¡evski, Riste Å krekovski +1

An odd independent set $S$ in a graph $G = (V, E)$ is an independent set of vertices such that, for every vertex $v \in V ∖ S$ , either $N (v) \cap S = \emptyset$ or $|N(v) \cap…

math.CO2025

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 $S$ in a graph $G = (V, E)$ is an independent set of vertices such that, for every vertex $v \in V ∖ S$ , either $N (v) \cap S = \emptyset$ or $|N(v) \cap…

math.CO2025

On Graph Odd Edge-Colorings and Odd Edge-Coverings

Xiao-Chuan Liu, Mirko PetruÅ¡evski, Xu Yang

An odd $k$ -edge-coloring of a graph $G$ is a (not necessarily proper) edge-coloring with at most $k$ colors such that each non-empty color class induces a graph in which every vert…