Induced-path partition on graphs with special blocks

DOI10.1016/j.tcs.2006.10.020zbMath1118.68105OpenAlexW2058112734MaRDI QIDQ868947

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

zbMATH Keywords

algorithmcycleblockcomplete bipartite graphcomplete graphinduced path

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Fast-mixed searching and related problems on graphs ⋮ Induced path factors of regular graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• n-tuple colorings and associated graphs
• Splitting a graph into disjoint induced paths or cycles.
• The point-arboricity of a graph
• COVERING AND PACKING IN GRAPHS, I.
• Decomposition of Finite Graphs Into Forests

This page was built for publication: Induced-path partition on graphs with special blocks