Acyclic graphoidal covers and path partitions in a graph
From MaRDI portal
Publication:1584403
DOI10.1016/S0012-365X(98)00032-6zbMATH Open0956.05086OpenAlexW2021962931MaRDI QIDQ1584403FDOQ1584403
Authors: 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
Recommendations
- Path partitions and packs of acyclic digraphs
- Simple acyclic graphoidal covers in a graph
- scientific article; zbMATH DE number 4045794
- scientific article; zbMATH DE number 1539543
- Partial and perfect path covers of cographs
- scientific article; zbMATH DE number 5592867
- Covering the complete graph by partitions
- On graphoidal covers of bicyclic graphs
- Covering pairs in directed acyclic graphs
- Covers in partitioned intersecting hypergraphs
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)
Cites Work
- Title not available (Why is that?)
- Graphoidal covers and graphoidal covering number of a graph
- On the graphoidal covering number of a graph
- Title not available (Why is that?)
- COVERING AND PACKING IN GRAPHS, I.
- The graphoidal covering number of unicyclic graphs
- Title not available (Why is that?)
- Graphs with unique minimum graphoidal cover
- Labelings of discrete structures -- new challenges
Cited In (20)
- Truly non-trivial graphoidal graphs
- Title not available (Why is that?)
- Graphs whose acyclic graphoidal covering number is one less than its maximum degree
- New Bounds of Induced Acyclic Graphoidal Decomposition Number of a Graph
- Partial and perfect path covers of cographs
- Decomposing graphs into internally-disjoint induced paths
- Decomposition of graphs into paths and cycles
- Domination in graphoidally covered graphs: least-kernel graphoidal graphs. II
- Induced label graphoidal graphs
- Acyclic digraphs with Gallai-Milgram-Linial property for clique-covers
- Graphoidal graphs and graphoidal digraphs: a generalization of line graphs
- Graphoidally independent infinite graphs
- On graphoidal length of a tree in terms of its diameter
- Difference Labeling and Decomposition
- Equality of graphoidal and acyclic graphoidal covering number of a graph.
- Title not available (Why is that?)
- ON THE LABEL GRAPHOIDAL COVERING NUMBER-II
- On graphoidal graphs
- Monophonic graphoidal covering number of corona product graphs
- Path partitions and packs of acyclic digraphs
This page was built for publication: Acyclic graphoidal covers and path partitions in a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1584403)
