Niche numbers
From MaRDI portal
Publication:4013415
DOI10.1002/JGT.3190160204zbMATH Open0758.05092OpenAlexW2914451955MaRDI QIDQ4013415FDOQ4013415
Peter Fishburn, William V. Gehrlein
Publication date: 27 September 1992
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190160204
Recommendations
Cites Work
Cited In (17)
- Competition numbers of graphs with a small number of triangles
- \(p\)-competition numbers
- The competition number of a graph with exactly \(h\) holes, all of which are independent
- Any complete preference structure without circuit admits an interval representation
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Niche hypergraphs
- The competition number of a graph having exactly one hole
- Some recent results on niche graphs
- Niche graphs
- The smallest graphs with niche number three
- Niche number four
- The \(m\)-step competition graph of a digraph
- The niche graphs of bipartite tournaments
- \(p\)-competition graphs
- Loop and cyclic niche graphs
This page was built for publication: Niche numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4013415)