Partitioning graphs into paths or cycles of prescribed lengths

DOI10.4310/JOC.2012.V3.N2.A1zbMATH Open1262.05129MaRDI QIDQ1937351

Colton Magnant, Kenta Ozeki

Publication date: 28 February 2013

Published in: Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

degree sumdisjoint pathsgraph partitiondisjoint cyclespath length

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Applications of graph theory (05C90) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (7)

Partitions of digraphs into paths or circuits ⋮ Partitioning a graph into cycles with a specified number of chords ⋮ Splitting a graph into disjoint induced paths or cycles. ⋮ Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ Partition of a travel into circuits ⋮ A fast randomized algorithm for partitioning a graph into paths of fixed length ⋮ Minimum cycle partition with length requirements

Recommendations

• Title not available (Why is that?) 👍 👎
• Partition of a graph into cycles and vertices 👍 👎
• Partitions of digraphs into paths or circuits 👍 👎
• Path partitioning planar graphs with restrictions on short cycles 👍 👎
• Partitions of a graph into paths with prescribed endvertices and lengths 👍 👎
• Cycle Partitions in Graphs 👍 👎
• Partitioning a graph into cycles with a specified number of chords 👍 👎
• Partitioning a graph into vertex-disjoint paths 👍 👎
• Graph partition problems into cycles and paths 👍 👎
• On the path partition of graphs 👍 👎

This page was built for publication: Partitioning graphs into paths or cycles of prescribed lengths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1937351)