Path partitionable graphs

MaRDI QIDQ3166152zbMATH OpenFDO

Authors G. Sethuraman

Publication date 21 October 2012

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)

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

Cited in

(11)

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

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)