Path partitions and \(P_{n}\)-free sets
From MaRDI portal
Publication:1763347
DOI10.1016/j.disc.2004.07.012zbMath1056.05085OpenAlexW2140959314MaRDI QIDQ1763347
Frank Bullock, Jean E. Dunbar, Marietjie Frick
Publication date: 22 February 2005
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2004.07.012
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
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 ⋮ On the existence of vertex-disjoint subgraphs with high degree sum ⋮ Path partitioning planar graphs with restrictions on short cycles ⋮ A note on a cycle partition problem ⋮ Longest path partitions in generalizations of tournaments ⋮ On a cycle partition problem ⋮ A note on the path Kernel conjecture ⋮ On a tree-partition problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Partition of graphs with condition on the connectivity and minimum degree
- Graph decomposition with constraints on the connectivity and minimum degree
- A survey of hereditary properties of graphs
- Partition problems and kernels of graphs
- A path(ological) partition problem
- On Detours in Graphs1
