Niche hypergraphs of products of digraphs
From MaRDI portal
Publication:2282480
DOI10.7151/dmgt.2138zbMath1430.05084OpenAlexW2884493065WikidataQ129523692 ScholiaQ129523692MaRDI QIDQ2282480
Hanns-Martin Teichert, Martin Sonntag
Publication date: 8 January 2020
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.2138
Hypergraphs (05C65) Directed graphs (digraphs), tournaments (05C20) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Unnamed Item
- Unnamed Item
- Niche hypergraphs
- A generalization of Opsut's result on the competition numbers of line graphs
- The double competition hypergraph of a digraph
- The competition numbers of ternary Hamming graphs
- Competition numbers of complete \(r\)-partite graphs
- Competition hypergraphs of products of digraphs
- Products of digraphs and their competition graphs
- The competition-common enemy graph of a digraph
- Niche graphs
- Competition hypergraphs
- Transversals and competition numbers of complete multipartite graphs
- The competition number of the complement of a cycle
- On the hypercompetition numbers of hypergraphs with maximum degree at most two
- Food Webs, Competition Graphs, and Habitat Formation
- On the hypercompetition numbers of hypergraphs
- Competition Numbers, Quasi-line Graphs, and Holes
- The competition number of a generalized line graph is at most two
This page was built for publication: Niche hypergraphs of products of digraphs