Graphoidally independent infinite graphs
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 599133
- scientific article; zbMATH DE number 887777
- A characterization of the indecomposable and infinite graphs
- scientific article; zbMATH DE number 3943869
- Publication:3204497
- Infinite graphs with finite dominating sets
- Distinguishing infinite graphs
- Arithmetically maximal independent sets in infinite graphs
- Linearly bounded infinite graphs
- Mathematical Foundations of Computer Science 2005
Cites work
- A note on the graphoidal covering number of a graph
- Acyclic graphoidal covers and path partitions in a graph
- Bounds on graphoidal length of a graph
- Domination in graphoidal covers of a graph
- Further results on domination in graphoidally covered graphs
- Graphoidal bipartite graphs
- Graphoidal covers and graphoidal covering number of a graph
- Graphs with unique minimum graphoidal cover
- scientific article; zbMATH DE number 3172309 (Why is no real title available?)
- scientific article; zbMATH DE number 854567 (Why is no real title available?)
- On the graphoidal covering number of a graph
- ON THE LABEL GRAPHOIDAL COVERING NUMBER-II
Cited in
(4)
This page was built for publication: Graphoidally independent infinite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5016218)