Graphoidal covers and graphoidal covering number of a graph
From MaRDI portal
Publication:1091403
zbMath0623.05042MaRDI QIDQ1091403
E. Sampathkumar, Belmannu Devadas Acharya
Publication date: 1987
Published in: Indian Journal of Pure \& Applied Mathematics (Search for Journal in Brave)
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (20)
SIMPLE GRAPHOIDAL COVER ON TENSOR PRODUCT OF GRAPHS ⋮ Graphoidal bipartite graphs ⋮ Unnamed Item ⋮ On graphs whose graphoidal domination number is one ⋮ Domination in graphoidally covered graphs: least-kernel graphoidal graphs. II ⋮ Bounds on graphoidal length of a graph ⋮ Domination in graphoidally covered graphs: least-kernel graphoidal covers ⋮ Unnamed Item ⋮ Truly non-trivial graphoidal graphs ⋮ Monophonic graphoidal covering number of corona product graphs ⋮ Difference Labeling and Decomposition ⋮ On partitioning the edge set of a graph into internally disjoint paths without exterior vertices ⋮ New Bounds of Induced Acyclic Graphoidal Decomposition Number of a Graph ⋮ The distinguishing number and the distinguishing index of line and graphoidal graph(s) ⋮ Induced graphoidal decompositions in product graphs ⋮ Induced label graphoidal 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: Graphoidal covers and graphoidal covering number of a graph
