scientific article; zbMATH DE number 1539543
From MaRDI portal
Publication:4519730
Recommendations
- Graphs whose acyclic graphoidal covering number is one less than its maximum degree
- Equality of graphoidal and acyclic graphoidal covering number of a graph.
- Graphs with unique minimum acyclic graphoidal cover – I
- Acyclic graphoidal covers and path partitions in a graph
- scientific article; zbMATH DE number 2192125
Cited in
(5)- Acyclic digraphs with Gallai-Milgram-Linial property for clique-covers
- Multiplicativity of acyclic digraphs
- Acyclic graphoidal covers and path partitions in a graph
- scientific article; zbMATH DE number 2192125 (Why is no real title available?)
- Graphs whose acyclic graphoidal covering number is one less than its maximum degree
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4519730)