Simple acyclic graphoidal covers in a graph

MaRDI QIDQ5294935zbMATH OpenFDO

Authors S. Arumugam, I. Sahul Hamid

Publication date 26 July 2007

Mathematics Subject Classification ID

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

Recommendations

• Graphs with unique minimum simple acyclic graphoidal cover
• Simple graphoidal covers in a graph
• Equality of graphoidal and acyclic graphoidal covering number of a graph.
• Graphs with unique minimum acyclic graphoidal cover – I
• scientific article; zbMATH DE number 2192125

Cited in

(10)

• Acyclic digraphs with Gallai-Milgram-Linial property for clique-covers
• Acyclic graphoidal covers and path partitions in a graph
• Simple path covers in graphs
• Simple graphoidal covers in a graph
• Graphs with unique minimum simple acyclic graphoidal cover
• Graphs with unique minimum acyclic graphoidal cover – I
• Decomposing graphs into internally-disjoint induced paths
• scientific article; zbMATH DE number 2192125 (Why is no real title available?)
• On partitioning the edge set of a graph into internally disjoint paths without exterior vertices
• Decomposition of graphs into geodesic paths

This page was built for publication: Simple acyclic graphoidal covers in a graph

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