A path(ological) partition problem
From MaRDI portal
Publication:4222386
DOI10.7151/dmgt.1068zbMath0912.05048OpenAlexW1979719950MaRDI QIDQ4222386
Marietjie Frick, Izak Broere, Jean E. Dunbar
Publication date: 9 May 1999
Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/53f129a8098bb4d84ff305d2116faab63d88f3b9
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (11)
Path partitioning planar graphs of girth 4 without adjacent short cycles ⋮ Extended path partition conjecture for semicomplete and acyclic compositions ⋮ The path partition conjecture is true for claw-free graphs ⋮ Path partitioning planar graphs with restrictions on short cycles ⋮ Detour-saturated graphs ⋮ Path partitions and \(P_{n}\)-free sets ⋮ A note on path kernels and partitions ⋮ Longest path partitions in generalizations of tournaments ⋮ On a cycle partition problem ⋮ Unnamed Item ⋮ Partition of a planar graph with girth 6 into two forests with chain length at most 4
This page was built for publication: A path(ological) partition problem