Path partitionable graphs

zbMATH Open1248.05162MaRDI QIDQ3166152FDOQ3166152

Authors: G. Sethuraman 

Publication date: 21 October 2012

Recommendations

• An asymptotic result for the path partition conjecture
• The path partition conjecture is true for claw-free graphs
• A new approach to the path partition conjecture
• Path partitions and \(P_{n}\)-free sets
• Path partitioning planar graphs with restrictions on short cycles

zbMATH Keywords

path partition conjecture2-edge-connected graphsear-decompositions

Mathematics Subject Classification ID

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

Cited In (11)

• Detour Chromatic Numbers
• Cycle partition of two-connected and two-edge connected graphs
• Path partitioning planar graphs with restrictions on short cycles
• A new approach to the path partition conjecture
• Path partitions and \(P_{n}\)-free sets
• Path partitions and forward-only trellis algorithms
• Conditions for graphs to be path partition optimal
• Graphs with a path partition for structuring digital spaces
• An asymptotic result for the path partition conjecture
• Partitions of digraphs into paths or circuits
• Path Separability of Graphs

This page was built for publication: Path partitionable graphs

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