48 citations · 102 across the 14 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
math.CO2017★ 3 cited
Generalised Mycielski graphs and the Borsuk-Ulam theorem
Tobias Müller, Matěj Stehlík
Stiebitz determined the chromatic number of generalised Mycielski graphs using the topological method of Lovasz, which invokes the Borsuk-Ulam theorem. Van Ngoc and Tuza used eleme…
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…