The graphoidal covering number of unicyclic graphs

zbMath0768.05079MaRDI QIDQ1183956

C. Pakkiam, S. Arumugam

Publication date: 28 June 1992

Published in: Indian Journal of Pure \& Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

pathsunicyclic graphsgraphoidal covergraphoidal covering number

Mathematics Subject Classification ID

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

Related Items (4)

Monophonic graphoidal covering number of corona product graphs ⋮ On partitioning the edge set of a graph into internally disjoint paths without exterior vertices ⋮ Acyclic graphoidal covers and path partitions in a graph ⋮ Graphoidal graphs and graphoidal digraphs: a generalization of line graphs

This page was built for publication: The graphoidal covering number of unicyclic graphs