Graphs with unique minimum simple acyclic graphoidal cover

MaRDI QIDQ3565886zbMATH OpenFDO

Authors S. Arumugam, I. Sahul Hamid

Publication date 7 June 2010

zbMATH Keywords

simple acyclic graphoidal cover

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Simple acyclic graphoidal covers in a graph
• Graphs with unique minimum simple graphoidal cover
• Graphs with unique minimum acyclic graphoidal cover – I
• Equality of graphoidal and acyclic graphoidal covering number of a graph.
• Simple graphoidal covers in a graph

Cited in

(6)

• Simple graphoidal covers in a graph
• scientific article; zbMATH DE number 2075117 (Why is no real title available?)
• Graphs with unique minimum acyclic graphoidal cover – I
• Simple acyclic graphoidal covers in a graph
• Graphs with unique minimum simple graphoidal cover
• On partitioning the edge set of a graph into internally disjoint paths without exterior vertices

This page was built for publication: Graphs with unique minimum simple acyclic graphoidal cover

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