2 papers
math.CO2024
On high genus extensions of Negami's conjecture
Marcin Briański, James Davies, Jane Tan
Negami's famous planar cover conjecture is equivalent to the statement that a connected graph can be embedded in the projective plane if and only if it has a projective planar cove…
math.CO2024
Branch-depth is minor closure of contraction-deletion-depth
Marcin Briański, Daniel Kráľ, Kristýna Pekárková
The notion of branch-depth for matroids was introduced by DeVos, Kwon and Oum as the matroid analogue of the tree-depth of graphs. The contraction-deletion-depth, another tree-dept…