Partition problems and kernels of graphs

DOI10.7151/dmgt.1058zbMath0906.05059OpenAlexW2059195827MaRDI QIDQ4210673

Peter Mihók, Izak Broere, Péter Hajnal

Publication date: 14 February 1999

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/8690eb48f6d38ac731dd2451c68ee712c42042c1

zbMATH Keywords

partitionkernelslongest pathdecomposable

Mathematics Subject Classification ID

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

Related Items (8)

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 ⋮ Path partitions and \(P_{n}\)-free sets ⋮ Longest path partitions in generalizations of tournaments ⋮ 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: Partition problems and kernels of graphs