Acyclic graphoidal covers and path partitions in a graph

DOI10.1016/S0012-365X(98)00032-6zbMath0956.05086OpenAlexW2021962931MaRDI QIDQ1584403

S. Arumugam, J. Suresh Suseela

Publication date: 2 November 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(98)00032-6

zbMATH Keywords

characterizationacyclic graphoidal coverpath partition number

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Related Items (13)

Unnamed Item ⋮ Domination in graphoidally covered graphs: least-kernel graphoidal graphs. II ⋮ On graphoidal graphs ⋮ Truly non-trivial graphoidal graphs ⋮ Monophonic graphoidal covering number of corona product graphs ⋮ Difference Labeling and Decomposition ⋮ New Bounds of Induced Acyclic Graphoidal Decomposition Number of a Graph ⋮ ON THE LABEL GRAPHOIDAL COVERING NUMBER-II ⋮ Decomposition of graphs into paths and cycles ⋮ Induced label graphoidal graphs ⋮ 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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graphoidal covers and graphoidal covering number of a graph
• On the graphoidal covering number of a graph
• The graphoidal covering number of unicyclic graphs
• Graphs with unique minimum graphoidal cover
• COVERING AND PACKING IN GRAPHS, I.

This page was built for publication: Acyclic graphoidal covers and path partitions in a graph