Significant differences between path partitions in directed and undirected graphs

MaRDI QIDQ3105538zbMATH OpenFDO

Authors Marietjie Frick, Susan Van Aardt, Carol A. Whitehead

Publication date 5 January 2012

zbMATH Keywords

deficiencylongest path

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• A survey of the path partition conjecture
• The Path Partition Conjecture
• Longest path partitions in generalizations of tournaments
• The directed path partition conjecture
• A new approach to the path partition conjecture

Cited in

(4)

• Cycles in \(k\)-traceable oriented graphs
• Traceability of k-traceable oriented graphs
• A new approach to the path partition conjecture
• A survey of the path partition conjecture

This page was built for publication: Significant differences between path partitions in directed and undirected graphs

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