activity
20062026
most citedReplication in critical graphs and the persistence of monomial ideals

48 citations · 253 across the 49 of their papers we have counts for

collaborators
Showing 2013Show all

7 papers · 1 filter

math.CO2013

Strong edge coloring of subcubic bipartite graphs

Borut Lužar, Martina Mockovčiaková, Roman Soták +1

A strong edge coloring of a graph is a proper edge coloring in which each color class is an induced matching of . In 1993, Brualdi and Quinn Massey proposed a conjecture tha…

math.CO2013★ 42 cited

Star edge coloring of some classes of graphs

Ľudmila Bezegová, Borut Lužar, Martina Mockovčiaková +2

\textit{A star edge coloring} of a graph is a proper edge coloring without bichromatic paths and cycles of length four. In this paper we establish tight upper bounds for trees and…

math.CO2013★ 11 cited

Choosability of the square of a planar graph with maximum degree four

Daniel W. Cranston, Rok Erman, Riste Škrekovski

We study squares of planar graphs with the aim to determine their list chromatic number. We present new upper bounds for the square of a planar graph with maximum degree .…

math.CO2013★ 8 cited

l-facial edge colorings of graphs

Borut Lužar, Martina Mockovčiaková, Roman Soták +2

An l-facial edge coloring of a plane graph is a coloring of the edges such that any two edges at distance at most l on a boundary walk of some face receive distinct colors. It is c…

math.CO2013

Sufficient sparseness conditions for G^2 to be (Δ+1)-choosable, when Δ\ge5

Daniel W. Cranston, Riste Škrekovski

We determine the list chromatic number of the square of a graph $\chil(G^2)$ in terms of its maximum degree when its maximum average degree, denoted $\mad(G)$, is sufficiently…

math.CO2013★ 35 cited

Strong edge coloring of planar graphs

Dávid Hudák, Borut Lužar, Roman Soták +1

A strong edge coloring of a graph is a proper edge coloring where the edges at distance at most two receive distinct colors. It is known that every planar graph with maximum degree…

math.CO2013★ 48 cited

Replication in critical graphs and the persistence of monomial ideals

Tomáš Kaiser, Matěj Stehlík, Riste Škrekovski

Motivated by questions about square-free monomial ideals in polynomial rings, in 2010 Francisco et al. conjectured that for every positive integer k and every k-critical (i.e., cri…