On the graphoidal covering number of a graph

zbMath0673.05080MaRDI QIDQ1120599

S. Arumugam, C. Pakkiam

Publication date: 1989

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

zbMATH Keywords

pathsgraphoidal 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 (11)

SIMPLE GRAPHOIDAL COVER ON TENSOR PRODUCT OF GRAPHS ⋮ Graphoidal bipartite graphs ⋮ Domination in graphoidally covered graphs: least-kernel graphoidal graphs. II ⋮ Bounds on graphoidal length of a graph ⋮ Unnamed Item ⋮ Truly non-trivial graphoidal graphs ⋮ Monophonic graphoidal covering number of corona product graphs ⋮ Acyclic graphoidal covers and path partitions in a graph ⋮ Graphoidal graphs and graphoidal digraphs: a generalization of line graphs ⋮ On graphoidal length of a tree in terms of its diameter ⋮ Graphoidally independent infinite graphs

This page was built for publication: On the graphoidal covering number of a graph