Niche hypergraphs
From MaRDI portal
Publication:339464
DOI10.7151/dmgt.1893zbMath1350.05112OpenAlexW4242907603MaRDI QIDQ339464
Hanns-Martin Teichert, Christian Garske, Martin Sonntag
Publication date: 11 November 2016
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.1893
Related Items (3)
Competition numbers and phylogeny numbers: uniform complete multipartite graphs ⋮ Niche hypergraphs of products of digraphs ⋮ A note on a conjecture on niche hypergraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- On Opsut's conjecture for hypercompetition numbers of hypergraphs
- Some recent results on niche graphs
- Competition hypergraphs of products of digraphs
- On CCE graphs of doubly partial orders
- Dimension-2 poset competition numbers and dimension-2 poset double competition numbers
- Two minimal forbidden subgraphs for double competition graphs of posets of dimension at most two
- The competition-common enemy graph of a digraph
- Niche graphs
- The smallest graphs with niche number three
- Niche number four
- Loop and cyclic niche graphs
- Competition hypergraphs
- Transversals and competition numbers of complete multipartite graphs
- The competition number of the complement of a cycle
- The competition hypergraphs of doubly partial orders
- The niche graphs of interval orders
- On the hypercompetition numbers of hypergraphs with maximum degree at most two
- Food Webs, Competition Graphs, and Habitat Formation
- The competition-common enemy graphs of digraphs satisfying Conditions $C(p)$ and $C'(p)$
- On the hypercompetition numbers of hypergraphs
- Competition hypergraphs of digraphs with certain properties I. Strong connectedness
- Competition hypergraphs of digraphs with certain properties II. Hamiltonicity
- The niche graphs of doubly partial orders
- Niche numbers
- Niche graphs and mixed pair graphs of tournaments
- 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
