A path(ological) partition problem

DOI10.7151/DMGT.1068MaRDI QIDQ4222386zbMATH OpenOpenAlexFDO

Authors Izak Broere, Marietjie Frick, 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

zbMATH Keywords

longest pathvertex partitiondecomposable graph\(\tau\)-partitionable

Mathematics Subject Classification ID

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

Recommendations

• Graphs with not all possible path-kernels
• Publication:4943521
• An asymptotic result for the path partition conjecture
• Path partitionable graphs
• Partitioning a graph into vertex-disjoint paths

Cited in

(13)

• Path partitioning planar graphs of girth 4 without adjacent short cycles
• On a cycle partition problem
• A note on path kernels and partitions
• Path partitioning planar graphs with restrictions on short cycles
• Path partitions and \(P_{n}\)-free sets
• Graphs with not all possible path-kernels
• scientific article; zbMATH DE number 2230277 (Why is no real title available?)
• Longest path partitions in generalizations of tournaments
• Extended path partition conjecture for semicomplete and acyclic compositions
• The path partition conjecture is true for claw-free graphs
• Partition of a travel into circuits
• Detour-saturated graphs
• 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

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