Almost partitioning every 2-edge-coloured complete k-graph into k monochromatic tight cycles (2023)

First Author: Lo A

Attributed to: Matchings and tilings in graphs funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.5817/cz.muni.eurocomb23-100

Publication URI: http://dx.doi.org/10.5817/cz.muni.eurocomb23-100

Type: Conference/Paper/Proceeding/Abstract