Simple graphoidal covers in a graph

MaRDI QIDQ3507251zbMATH OpenFDO

Authors S. Arumugam, I. Sahul Hamid

Publication date 18 June 2008

zbMATH Keywords

pathssimple graphoidal cover

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 graphoidal cover
• Simple acyclic graphoidal covers in a graph
• Graphs with unique minimum simple acyclic graphoidal cover
• On the graphoidal covering number of a graph
• A note on the graphoidal covering number of a graph

Cited in

(10)

• Induced label graphoidal graphs
• Simple path covers in graphs
• Bounds on graphoidal length of a graph
• New Bounds of Induced Acyclic Graphoidal Decomposition Number of a Graph
• Graphs with unique minimum simple acyclic graphoidal cover
• A note on the graphoidal covering number of a graph
• SIMPLE GRAPHOIDAL COVER ON TENSOR PRODUCT OF GRAPHS
• Geodesic graphoidal covering number of a graph
• Simple acyclic graphoidal covers in a graph
• Graphs with unique minimum simple graphoidal cover

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

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