Graphoidally independent infinite graphs
From MaRDI portal
Publication:5016218
DOI10.1080/09728600.2021.1953946zbMath1476.05153OpenAlexW3186129569MaRDI QIDQ5016218
Publication date: 13 December 2021
Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/09728600.2021.1953946
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Infinite graphs (05C63)
Cites Work
- Unnamed Item
- Unnamed Item
- Bounds on graphoidal length of a graph
- Graphoidal covers and graphoidal covering number of a graph
- On the graphoidal covering number of a graph
- Domination in graphoidal covers of a graph
- Graphoidal bipartite graphs
- Graphs with unique minimum graphoidal cover
- Acyclic graphoidal covers and path partitions in a graph
- Further results on domination in graphoidally covered graphs
- ON THE LABEL GRAPHOIDAL COVERING NUMBER-II
- A note on the graphoidal covering number of a graph
This page was built for publication: Graphoidally independent infinite graphs