Igor Fabrici

28 papers Journal 28
YearRankTypeTitle / Venue / Authors
2023 J jnl
Proper conflict-free and unique-maximum colorings of planar graphs with respect to neighborhoods.
Discret. Appl. Math.
Igor Fabrici, Borut Luzar, Simona Rindosová, Roman Soták
2022 J jnl
Proper conflict-free and unique-maximum colorings of planar graphs with respect to neighborhoods.
CoRR
Igor Fabrici, Borut Luzar, Simona Rindosová, Roman Soták
2021 J jnl
Circumference of essentially 4-connected planar triangulations.
J. Graph Algorithms Appl.
Igor Fabrici, Jochen Harant, Samuel Mohr, Jens M. Schmidt
2021 J jnl
Colorings of plane graphs without long monochromatic facial paths.
Discuss. Math. Graph Theory
Július Czap, Igor Fabrici, Stanislav Jendrol'
2021 J jnl
Facial unique-maximum edge and total coloring of plane graphs.
Discret. Appl. Math.
Igor Fabrici, Mirko Hornák, Simona Rindosová
2021 J jnl
Non-hamiltonian graphs in which every edge-contracted subgraph is hamiltonian.
Appl. Math. Comput.
Igor Fabrici, Tomás Madaras, Maria Timkova, Nico Van Cleemput, Carol T. Zamfirescu
2020 J jnl
Long cycles and spanning subgraphs of locally maximal 1-planar graphs.
J. Graph Theory
Igor Fabrici, Jochen Harant, Tomás Madaras, Samuel Mohr, Roman Soták, Carol T. Zamfirescu
2020 J jnl
Longer cycles in essentially 4-connected planar graphs.
Discuss. Math. Graph Theory
Igor Fabrici, Jochen Harant, Samuel Mohr, Jens M. Schmidt
2020 J jnl
On the Circumference of Essentially 4-connected Planar Graphs.
J. Graph Algorithms Appl.
Igor Fabrici, Jochen Harant, Samuel Mohr, Jens M. Schmidt
2018 J jnl
Even Longer Cycles in Essentially 4-Connected Planar Graphs.
CoRR
Igor Fabrici, Jochen Harant, Samuel Mohr, Jens M. Schmidt
2017 J jnl
Longer Cycles in Essentially 4-Connected Planar Graphs.
CoRR
Igor Fabrici, Jochen Harant, Samuel Mohr, Jens M. Schmidt
2016 J jnl
Facial entire colouring of plane graphs.
Discret. Math.
Igor Fabrici, Stanislav Jendrol', Michaela Vrbjarová
2016 J jnl
Facial list colourings of plane graphs.
Discret. Math.
Igor Fabrici, Stanislav Jendrol', Margit Voigt
2016 J jnl
On Longest Cycles in Essentially 4-connected Planar Graphs.
Electron. Notes Discret. Math.
Jochen Harant, Igor Fabrici, Stanislav Jendrol'
2016 J jnl
On longest cycles in essentially 4-connected planar graphs.
Discuss. Math. Graph Theory
Igor Fabrici, Jochen Harant, Stanislav Jendrol'
2016 J jnl
Unique-maximum coloring of plane graphs.
Discuss. Math. Graph Theory
Igor Fabrici, Frank Göring
2015 J jnl
Unique-maximum edge-colouring of plane graphs with respect to faces.
Discret. Appl. Math.
Igor Fabrici, Stanislav Jendrol', Michaela Vrbjarová
2014 J jnl
A note on vertex colorings of plane graphs.
Discuss. Math. Graph Theory
Igor Fabrici, Jochen Harant, Stanislav Jendrol', Roman Soták
2013 J jnl
On vertices enforcing a Hamiltonian cycle.
Discuss. Math. Graph Theory
Igor Fabrici, Erhard Hexel, Stanislav Jendrol'
2008 J jnl
Paths of low weight in planar graphs.
Discuss. Math. Graph Theory
Igor Fabrici, Jochen Harant, Stanislav Jendrol'
2007 J jnl
Light graphs in families of outerplanar graphs.
Discret. Math.
Igor Fabrici
2007 J jnl
The structure of 1-planar graphs.
Discret. Math.
Igor Fabrici, Tomás Madaras
2002 J jnl
On vertex-degree restricted subgraphs in polyhedral graphs.
Discret. Math.
Igor Fabrici
2000 J jnl
Non-hamiltonian polyhedral graphs with two types of faces.
Discret. Math.
Igor Fabrici, Peter J. Owens, Hansjoachim Walther
2000 J jnl
On vertex-degree restricted paths in polyhedral graphs.
Discret. Math.
Igor Fabrici, Erhard Hexel, Stanislav Jendrol', Hansjoachim Walther
1998 J jnl
Subgraphs with restricted degrees of their vertices in planar graphs.
Discret. Math.
Igor Fabrici, Stanislav Jendrol'
1997 J jnl
Subgraphs with Restricted Degrees of Their Vertices in Planar 3-Connected Graphs.
Graphs Comb.
Igor Fabrici, Stanislav Jendrol'
1996 J jnl
An inequality concerning edges of minor weight in convex 3-polytopes.
Discuss. Math. Graph Theory
Igor Fabrici, Stanislav Jendrol'