Monochromatic Path and Cycle Partitions in Hypergraphs - researchr publication related

researchr

You are not signed in
Sign in
Sign up

András Gyárfás, Gábor N. Sárközy. Monochromatic Path and Cycle Partitions in Hypergraphs. Electr. J. Comb., 20(1):18, 2013. [doi]

The following publications are possibly variants of this publication:

Monochromatic Loose-cycle Partitions in HypergraphsAndrás Gyárfás, Gábor N. Sárközy. combinatorics, 21(2):2, 2014. [doi]

Improved monochromatic loose cycle partitions in hypergraphsGábor N. Sárközy. DM, 334:52-62, 2014. [doi]

Monochromatic square-cycle and square-path partitionsGábor N. Sárközy. DM, 345(3):112712, 2022. [doi]

Partitioning 2-edge-colored graphs by monochromatic paths and cyclesJózsef Balogh, János Barát, Dániel Gerbner, András Gyárfás, Gábor N. Sárközy. combinatorica, 34(5):507-526, 2014. [doi]

Monochromatic cycle power partitionsGábor N. Sárközy. DM, 340(2):72-80, 2017. [doi]

runs on WebDSL