On a tree-partition problem

DOI10.1016/J.ENDM.2007.01.046MaRDI QIDQ3439601zbMATH OpenOpenAlexFDO

Authors Peter Katrenič, Gabriel Semanišin

Publication date 29 May 2007

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2007.01.046

zbMATH Keywords

generalized colouringpath kernelpath kernel conjecturepath partition conjecturetree-partition problem

Mathematics Subject Classification ID

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

Cites work

• 25 pretty graph colouring problems
• A survey of hereditary properties of graphs
• An asymptotic result for the path partition conjecture
• Graphs with not all possible path-kernels
• scientific article; zbMATH DE number 3838057 (Why is no real title available?)
• scientific article; zbMATH DE number 3926824 (Why is no real title available?)
• scientific article; zbMATH DE number 1416470 (Why is no real title available?)
• scientific article; zbMATH DE number 3243267 (Why is no real title available?)
• scientific article; zbMATH DE number 2230277 (Why is no real title available?)
• Path partitions and \(P_{n}\)-free sets
• The path partition conjecture is true for claw-free graphs

This page was built for publication: On a tree-partition problem

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