Induced-path partition on graphs with special blocks
From MaRDI portal
(Redirected from Publication:868947)
Recommendations
Cites work
- scientific article; zbMATH DE number 3885934 (Why is no real title available?)
- scientific article; zbMATH DE number 3910413 (Why is no real title available?)
- scientific article; zbMATH DE number 3611388 (Why is no real title available?)
- scientific article; zbMATH DE number 638682 (Why is no real title available?)
- scientific article; zbMATH DE number 1161374 (Why is no real title available?)
- scientific article; zbMATH DE number 889959 (Why is no real title available?)
- scientific article; zbMATH DE number 3276423 (Why is no real title available?)
- scientific article; zbMATH DE number 3353324 (Why is no real title available?)
- COVERING AND PACKING IN GRAPHS, I.
- Decomposition of Finite Graphs Into Forests
- Splitting a graph into disjoint induced paths or cycles.
- The point-arboricity of a graph
- n-tuple colorings and associated graphs
Cited in
(8)- Fast-mixed searching and related problems on graphs
- Optimal path cover problem on block graphs
- Induced path factors of regular graphs
- Ramsey-type problems on induced covers and induced partitions toward the Gyárfás-Sumner conjecture
- Path partition for graphs with special blocks
- Parameterizing path partitions
- Induced cycle path number of derived graphs
- The influence of the addition or deletion of a vertex or an edge on the induced path number of a graph
This page was built for publication: Induced-path partition on graphs with special blocks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q868947)