Graph partition problems into cycles and paths

DOI10.1016/S0012-365X(00)00229-6zbMath0985.05036OpenAlexW2056735670MaRDI QIDQ5936020

Hikoe Enomoto

Publication date: 20 May 2002

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(00)00229-6

zbMATH Keywords

partitionpathscyclespacking2-factor

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (12)

A vertex cover with chorded 4-cycles ⋮ Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ Vertex partitions of \(r\)-edge-colored graphs ⋮ On the minimum monochromatic or multicolored subgraph partition problems ⋮ Degree sum conditions for vertex-disjoint cycles passing through specified vertices ⋮ Disjoint triangles and quadrilaterals in a graph ⋮ The complexity for partitioning graphs by monochromatic trees, cycles and paths ⋮ Partitioning 2-edge-colored complete multipartite graphs into monochromatic cycles, paths and trees ⋮ An asymptotic version of a conjecture by Enomoto and Ota ⋮ Minimum degree, independence number and pseudo \([2, b\)-factors in graphs] ⋮ On 2-factors with cycles containing specified edges in a bipartite graph ⋮ On Enomoto's problems in a bipartite graph

This page was built for publication: Graph partition problems into cycles and paths