An inequality concerning edges of minor weight in convex 3-polytopes. - Igor Fabrici; Stanislav Jendrol' (Discuss. Math. Graph Theory, 1996)

Subgraphs with Restricted Degrees of Their Vertices in Planar 3-Connected Graphs. - Igor Fabrici; Stanislav Jendrol' (Graphs Comb., 1997)

Subgraphs with restricted degrees of their vertices in planar graphs. - Igor Fabrici; Stanislav Jendrol' (Discret. Math., 1998)

On vertex-degree restricted paths in polyhedral graphs. - Igor Fabrici; Erhard Hexel; Stanislav Jendrol'; Hansjoachim Walther (Discret. Math., 2000)

Non-hamiltonian polyhedral graphs with two types of faces. - Igor Fabrici; Peter J. Owens; Hansjoachim Walther (Discret. Math., 2000)

On vertex-degree restricted subgraphs in polyhedral graphs. - Igor Fabrici (Discret. Math., 2002)

Light graphs in families of outerplanar graphs. - Igor Fabrici (Discret. Math., 2007)

The structure of 1-planar graphs. - Igor Fabrici; Tomás Madaras (Discret. Math., 2007)

Paths of low weight in planar graphs. - Igor Fabrici; Jochen Harant; Stanislav Jendrol' (Discuss. Math. Graph Theory, 2008)

On vertices enforcing a Hamiltonian cycle. - Igor Fabrici; Erhard Hexel; Stanislav Jendrol' (Discuss. Math. Graph Theory, 2013)

A note on vertex colorings of plane graphs. - Igor Fabrici; Jochen Harant; Stanislav Jendrol'; Roman Soták (Discuss. Math. Graph Theory, 2014)

Unique-maximum edge-colouring of plane graphs with respect to faces. - Igor Fabrici; Stanislav Jendrol'; Michaela Vrbjarová (Discret. Appl. Math., 2015)

Facial entire colouring of plane graphs. - Igor Fabrici; Stanislav Jendrol'; Michaela Vrbjarová (Discret. Math., 2016)

Facial list colourings of plane graphs. - Igor Fabrici; Stanislav Jendrol'; Margit Voigt (Discret. Math., 2016)

Unique-maximum coloring of plane graphs. - Igor Fabrici; Frank Göring (Discuss. Math. Graph Theory, 2016)

On Longest Cycles in Essentially 4-connected Planar Graphs. - Jochen Harant; Igor Fabrici; Stanislav Jendrol' (Electron. Notes Discret. Math., 2016)

Even Longer Cycles in Essentially 4-Connected Planar Graphs. - Igor Fabrici; Jochen Harant; Samuel Mohr; Jens M. Schmidt (CoRR, 2018)

Longer cycles in essentially 4-connected planar graphs. - Igor Fabrici; Jochen Harant; Samuel Mohr; Jens M. Schmidt (Discuss. Math. Graph Theory, 2020)

On the Circumference of Essentially 4-connected Planar Graphs. - Igor Fabrici; Jochen Harant; Samuel Mohr; Jens M. Schmidt (J. Graph Algorithms Appl., 2020)

Long cycles and spanning subgraphs of locally maximal 1-planar graphs. - Igor Fabrici; Jochen Harant; Tomás Madaras; Samuel Mohr; Roman Soták; Carol T. Zamfirescu (J. Graph Theory, 2020)

Non-hamiltonian graphs in which every edge-contracted subgraph is hamiltonian. - Igor Fabrici; Tomás Madaras; Maria Timkova; Nico Van Cleemput; Carol T. Zamfirescu (Appl. Math. Comput., 2021)

Facial unique-maximum edge and total coloring of plane graphs. - Igor Fabrici; Mirko Hornák; Simona Rindosová (Discret. Appl. Math., 2021)

Colorings of plane graphs without long monochromatic facial paths. - Július Czap; Igor Fabrici; Stanislav Jendrol' (Discuss. Math. Graph Theory, 2021)

Circumference of essentially 4-connected planar triangulations. - Igor Fabrici; Jochen Harant; Samuel Mohr; Jens M. Schmidt (J. Graph Algorithms Appl., 2021)

Proper conflict-free and unique-maximum colorings of planar graphs with respect to neighborhoods. - Igor Fabrici; Borut Luzar; Simona Rindosová; Roman Soták (Discret. Appl. Math., 2023)