On a tree-partition problem

DOI10.1016/J.ENDM.2007.01.046zbMath1293.05296OpenAlexW2032078618MaRDI QIDQ3439601

Peter Katrenič, Gabriel Semanisin

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

path partition conjecturepath kernelgeneralized colouringpath kernel conjecturetree-partition problem

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The path partition conjecture is true for claw-free graphs
• Path partitions and \(P_{n}\)-free sets
• Graphs with not all possible path-kernels
• An asymptotic result for the path partition conjecture
• A survey of hereditary properties of graphs
• 25 pretty graph colouring problems

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