Graphs with not all possible path-kernels

DOI10.1016/J.DISC.2004.02.012zbMATH Open1066.05107DBLPjournals/dm/AldredT04OpenAlexW2026328547WikidataQ56926698 ScholiaQ56926698MaRDI QIDQ1877673FDOQ1877673

Authors: Carsten Thomassen, R. E. L. Aldred 

Publication date: 19 August 2004

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2004.02.012

Recommendations

• Publication:4943521
• A note on the path Kernel conjecture
• Partition problems and kernels of graphs
• Path partitions and \(P_{n}\)-free sets
• A path(ological) partition problem

zbMATH Keywords

path partition conjecture

Mathematics Subject Classification ID

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

Cites Work

• Hypohamiltonian and hypotraceable graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (7)

• On a tree-partition problem
• A note on path kernels and partitions
• A note on the path Kernel conjecture
• On the Forking Path Conjecture
• A note on a cycle partition problem
• The path partition conjecture is true for claw-free graphs
• Title not available (Why is that?)

This page was built for publication: Graphs with not all possible path-kernels

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