Induced-path partition on graphs with special blocks
DOI10.1016/J.TCS.2006.10.020zbMATH Open1118.68105OpenAlexW2058112734MaRDI QIDQ868947FDOQ868947
Authors: Jun-Jie Pan, Gerard Jennhwa Chang 
Publication date: 26 February 2007
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2006.10.020
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Decomposition of Finite Graphs Into Forests
- The point-arboricity of a graph
- Splitting a graph into disjoint induced paths or cycles.
- Title not available (Why is that?)
- n-tuple colorings and associated graphs
- COVERING AND PACKING IN GRAPHS, I.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (8)
- Fast-mixed searching and related problems on graphs
- Induced path factors of regular graphs
- Optimal path cover problem on block 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
- The influence of the addition or deletion of a vertex or an edge on the induced path number of a graph
- Induced cycle path number of derived graphs
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)
