Path partitionable graphs

MaRDI QIDQ3166152zbMATH OpenFDO

Authors G. Sethuraman

Publication date 21 October 2012

zbMATH Keywords

2-edge-connected graphsear-decompositionspath partition conjecture

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

(12)

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

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)