4 citations · 5 across the 2 of their papers we have counts for
2 papers
math.CO2017★ 1 cited
Packing and covering odd cycles in cubic plane graphs with small faces
Diego Nicodemos, Matěj Stehlík
We show that any -connected cubic plane graph on vertices, with all faces of size at most , can be made bipartite by deleting no more than edges, where…
math.CO2016★ 4 cited
Fullerene graphs of small diameter
Diego Nicodemos, Matěj Stehlík
A fullerene graph is a cubic bridgeless plane graph with only pentagonal and hexagonal faces. We exhibit an infinite family of fullerene graphs of diameter , where …