Decomposing graphs into internally-disjoint induced paths

MaRDI QIDQ5205872zbMATH OpenFDO

Authors Mayamma Joseph, I. Sahul Hamid

Publication date 17 December 2019

Full work available at URL http://scientia.mat.utfsm.cl/archivos/vol27/Articulo-5.pdf

zbMATH Keywords

induced acyclic graphoidal decompositiongraphoidal decompositioninduced acyclic graphoidal decomposition number

Mathematics Subject Classification ID

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

Recommendations

• New Bounds of Induced Acyclic Graphoidal Decomposition Number of a Graph
• Induced graphoidal decompositions in product graphs
• Further results on induced graphoidal decomposition
• Induced label graphoidal graphs
• Decomposition of graphs into paths and cycles

Cites work

• scientific article; zbMATH DE number 2131198 (Why is no real title available?)
• scientific article; zbMATH DE number 3404271 (Why is no real title available?)
• A textbook of graph theory
• Acyclic graphoidal covers and path partitions in a graph
• COVERING AND PACKING IN GRAPHS, I.
• Further results on induced graphoidal decomposition
• Graphoidal covers and graphoidal covering number of a graph
• Simple acyclic graphoidal covers in a graph

Cited in

(6)

• New Bounds of Induced Acyclic Graphoidal Decomposition Number of a Graph
• Further results on induced graphoidal decomposition
• Induced graphoidal decompositions in product graphs
• Induced label graphoidal graphs
• Splitting a graph into disjoint induced paths or cycles.
• Finding multiple induced disjoint paths in general graphs

This page was built for publication: Decomposing graphs into internally-disjoint induced paths

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