Simple path covers in graphs

MaRDI QIDQ3066320zbMATH OpenFDO

Authors S. Arumugam, I. Sahul Hamid

Publication date 10 January 2011

Mathematics Subject Classification ID

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

Recommendations

• Path double covering number of product graphs
• Simple graphoidal covers in a graph
• Simple acyclic graphoidal covers in a graph
• On a class of polynomials associated with the paths in a graph and its application to minimum nodes disjoint path coverings of graphs
• Graphs with unique minimum simple graphoidal cover

Cited in

(9)

• Labeling, covering and decomposing of graphs -- Smarandache's notion in graph theory
• Path double covering number of product graphs
• scientific article; zbMATH DE number 6871091 (Why is no real title available?)
• Simple Paths and Cycles Avoiding Forbidden Paths
• scientific article; zbMATH DE number 6471182 (Why is no real title available?)
• Difference Labeling and Decomposition
• Equitable path decomposition of graphs
• Decomposition of graphs into geodesic paths
• On a class of polynomials associated with the paths in a graph and its application to minimum nodes disjoint path coverings of graphs

This page was built for publication: Simple path covers in graphs

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