Showing math.COShow all
2 papers · 1 filter
math.CO2024
Partitioning 2-edge-coloured bipartite graphs into monochromatic cycles
Fabrício Siqueira Benevides, Arthur Lima Quintino, Alexandre Talon
Given an -edge-colouring of the edges of a graph , we say that it can be partitioned into monochromatic cycles when there exists a set of vertex-disjoint monochromati…
math.CO2016
Decomposing 8-regular graphs into paths of length 4
Fábio Botler, Alexandre Talon
A -decomposition of a graph is a set of edge-disjoint copies of in that cover the edge set of . Graham and Häggkvist (1989) conjectured that any -regular g…