Acyclic graphoidal covers and path partitions in a graph
type: Item
instance of: scholarly article
title: Acyclic graphoidal covers and path partitions in a graph
zbMATH Open document ID: 0956.05086
DOI: 10.1016/S0012-365X(98)00032-6
author: S. Arumugam
author: J. Suresh Suseela
published in: Discrete Mathematics
publication date: 2000-11-02T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C75
zbMATH DE Number: 1524983
zbMATH Keywords: acyclic graphoidal cover
zbMATH Keywords: path partition number
zbMATH Keywords: characterization
MaRDI profile type: Publication
cites work: Graphoidal covers and graphoidal covering number of a graph
cites work: Q3532219
cites work: Graphs with unique minimum graphoidal cover
cites work: Q5572939
cites work: COVERING AND PACKING IN GRAPHS, I.
cites work: Q4324745
cites work: On the graphoidal covering number of a graph
cites work: The graphoidal covering number of unicyclic graphs
cites work: Q5628160
full work available at URL: s0012-365x(98)00032-6
OpenAlex ID: W2021962931
Recommended article: Path partitions and packs of acyclic digraphs
Recommended article: Q5294935
Recommended article: Q3783328
Recommended article: Q4519730
Recommended article: Partial and perfect path covers of cographs
Recommended article: Q5325510
Recommended article: Covering the complete graph by partitions
Recommended article: Q3009545
Recommended article: Covering Pairs in Directed Acyclic Graphs
Recommended article: Covers in partitioned intersecting hypergraphs
description: scientific article; zbMATH DE number 1524983