Graph partition problems into cycles and paths
From MaRDI portal
Recommendations
- Results on degrees and the structure of 2-factors
- Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
- scientific article; zbMATH DE number 2101287
- Degree conditions for the partition of a graph into cycles, edges and isolated vertices
- Partitioning graphs into paths or cycles of prescribed lengths
Cited in
(18)- On 2-factors with cycles containing specified edges in a bipartite graph
- On Enomoto's problems in a bipartite graph
- Partitions of digraphs into paths or circuits
- Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
- Partitioning graphs into paths or cycles of prescribed lengths
- A vertex cover with chorded 4-cycles
- Graphs with a path partition for structuring digital spaces
- On the minimum monochromatic or multicolored subgraph partition problems
- Partitioning 2-edge-colored complete multipartite graphs into monochromatic cycles, paths and trees
- An asymptotic version of a conjecture by Enomoto and Ota
- The complexity for partitioning graphs by monochromatic trees, cycles and paths
- Partitioning a graph into cycles with a specified number of chords
- Degree sum conditions for vertex-disjoint cycles passing through specified vertices
- A note on a cycle partition problem
- Disjoint triangles and quadrilaterals in a graph
- Results on degrees and the structure of 2-factors
- Minimum degree, independence number and pseudo \([2, b]\)-factors in graphs
- Vertex partitions of \(r\)-edge-colored graphs
This page was built for publication: Graph partition problems into cycles and paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5936020)
