Partition problems and kernels of graphs

DOI10.7151/DMGT.1058MaRDI QIDQ4210673zbMATH OpenOpenAlexFDO

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

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

decomposablekernelslongest pathpartition

Mathematics Subject Classification ID

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

Recommendations

• Publication:4943521
• Graphs with not all possible path-kernels
• A note on path kernels and partitions
• A note on the path Kernel conjecture
• A path(ological) partition problem

Cited in

(15)

• A note on the path Kernel conjecture
• Path partitioning planar graphs of girth 4 without adjacent short cycles
• Path partitions and \(P_{n}\)-free sets
• Graphs with not all possible path-kernels
• Extended path partition conjecture for semicomplete and acyclic compositions
• Path partitioning planar graphs with restrictions on short cycles
• Linear kernels for separating a graph into components of bounded size
• Longest path partitions in generalizations of tournaments
• scientific article; zbMATH DE number 1416470 (Why is no real title available?)
• Partition of a planar graph with girth 6 into two forests with chain length at most 4
• scientific article; zbMATH DE number 2230277 (Why is no real title available?)
• On three polynomial kernels of sequences for arbitrarily partitionable graphs
• The strong path partition conjecture holds for a = 9
• On the strong path partition conjecture
• The path partition conjecture is true for claw-free graphs

This page was built for publication: Partition problems and kernels of graphs

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