Showing math.COShow all
2 papers · 1 filter
math.CO2025
Extending edge-colorings of distance-2 matchings in the hypercube
Pál Bärnkopf
Casselgren, Markstörm, and Pham conjectured that any precolored dis\-tan\-ce-2 matching in the -dimensional cube with at most colors can be extended to a proper -ed…
math.CO2021
A note on internal partitions: the -regular case and beyond
Pál Bärnkopf, Zoltán Lóránt Nagy, Zoltán Paulovics
An internal or friendly partition of a graph is a partition of the vertex set into two nonempty sets so that every vertex has at least as many neighbours in its own class as in the…