The partial order competition dimensions of bipartite graphs
From MaRDI portal
Publication:1720310
DOI10.1016/j.dam.2018.06.025zbMath1404.05035OpenAlexW2887195004WikidataQ129394854 ScholiaQ129394854MaRDI QIDQ1720310
Soogang Eoh, Jung Yeun Lee, Yoshio Sano, Jihoon Choi, Suh-Ryung Kim
Publication date: 8 February 2019
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2018.06.025
bipartite graphplanar graph\(d\)-partial ordercompetition graphpartial order competition dimensionorder type for two points in \(\mathbb{R}^3\)
Related Items (1)
Cites Work
- Unnamed Item
- On the competition graphs of \(d\)-partial orders
- The \((1, 2)\)-step competition graph of a pure local tournament that is not round decomposable
- The (1,2)-step competition graph of a tournament
- Competition numbers of complete \(r\)-partite graphs
- 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
- On the partial order competition dimensions of chordal graphs
- Transversals and competition numbers of complete multipartite graphs
- The \(m\)-step competition graphs of doubly partial orders
- The competition number of the complement of a cycle
- The competition hypergraphs of doubly partial orders
- A class of acyclic digraphs with interval competition graphs
- Max-tolerance graphs as intersection graphs
- The niche graphs of doubly partial orders
- The phylogeny graphs of double partial orders
This page was built for publication: The partial order competition dimensions of bipartite graphs