33 citations · 47 across the 5 of their papers we have counts for
6 papers
Normal 6-edge-colorings of cubic graphs with oddness 2
Igor Fabrici, Borut Lužar, Roman Soták +1
A normal edge-coloring of a cubic graph is a proper edge-coloring, in which every edge is adjacent to edges colored with four distinct colors or to edges colored with two distinct…
Proper conflict-free and unique-maximum colorings of planar graphs with respect to neighborhoods
Igor Fabrici, Borut Lužar, Simona Rindošová +1
A {\em conflict-free coloring} of a graph {\em with respect to open} (resp., {\em closed}) {\em neighborhood} is a coloring of vertices such that for every vertex there is a color…
Circumference of essentially 4-connected planar triangulations
Igor Fabrici, Jochen Harant, Samuel Mohr +1
A -connected graph is essentially -connected if, for any -cut of , at most one component of contains at least two vertices. We prove that ev…
Long Cycles and Spanning Subgraphs of Locally Maximal 1-planar Graphs
Igor Fabrici, Jochen Harant, Tomáš Madaras +3
A graph is -planar if it has a drawing in the plane such that each edge is crossed at most once by another edge. Moreover, if this drawing has the additional property that for e…
On the Circumference of Essentially 4-connected Planar Graphs
Igor Fabrici, Jochen Harant, Samuel Mohr +1
A planar graph is essentially -connected if it is 3-connected and every of its 3-separators is the neighborhood of a single vertex. Jackson and Wormald proved that every essenti…
Longer Cycles in Essentially 4-Connected Planar Graphs
Igor Fabrici, Jochen Harant, Samuel Mohr +1
A planar 3-connected graph is called \emph{essentially -connected} if, for every 3-separator , at least one of the two components of is an isolated vertex. Jackson…