The Double Multicompetition Number of a Multigraph - Discrete and Computational Geometry and Graphs - page 143

References
1. Anderson, C.A., Jones, K.F., Lundgren, J.R., McKee, T.A.: Competition multi-
graphs and the multicompetition number. Ars Combin. 29B , 185-192 (1990)
2. Bak, O.-B., Kim, S.-R.: On the double competition number of a bipartite graph.
Congress. Numeran. 117 , 145-152 (1996)
3. Cohen, J.E.: Interval graphs and food webs. A finding and a problem. RAND
Corporation Document 17696-PR, Santa Monica, CA (1968)
4. Dutton, R.D., Brigham, R.C.: A characterization of competition graphs. Discrete
Appl. Math. 6 , 315-317 (1983)
5. Furedi, Z.: On the double competition number. Discrete Appl. Math. 82 , 251-255
(1998)
6. Jones, F.K., Lundgren, J.R., Roberts, F.S., Seager, S.: Some remarks on the double
competition number of a graph. Congress. Numeran. 60 , 17-24 (1987)
7. Kim, S.-R.: On the inequality dk ( G ) ≤ k ( G ) + 1. Ars Combin. 51 , 173-182 (1999)
8. Kim, S.-J., Kim, S.-R., Rho, Y.: On CCE graphs of doubly partial orders. Discrete
Appl. Math. 155 , 971-978 (2007)
9. Kim, S.-R., Roberts, F.S., Seager, S.: On 1 0 1-clear (0 , 1) matrices and the double
competition number of bipartite graphs. J. Combin. Inf. Syst. Sci. 17 , 302-315
(1992)
10. Lu, J., Wu, Y.: Two minimal forbidden subgraphs for double competition graphs
of posets of dimension at most two. Appl. Math. Lett. 22 , 841-845 (2009)
11. McKee, T.A., McMorris, F.R.: Topics in Intersection Graph Theory. SIAM Mono-
graphs on Discrete Mathematics and Applications. Society for Industrial and
Applied Mathematics (SIAM), Philadelphia (1999)
12. Park, J., Sano, Y.: The double competition multigraph of a digraph. Preprint, July
2013. arXiv:1307.5509
13. Roberts, F.S., Steif, J.E.: A characterization of competition graphs of arbitrary
digraphs. Discrete Appl. Math. 6 , 323-326 (1983)
14. Sano, Y.: Characterizations of competition multigraphs. Discrete Appl. Math. 157 ,
2978-2982 (2009)
15. Sano, Y.: The competition-common enemy graphs of digraphs satisfying Conditions
C ( p )and C ( p ). Congress. Numeran. 202 , 187-194 (2010)
16. Scott, D.D.: The competition-common enemy graph of a digraph. Discrete Appl.
Math. 17 , 269-280 (1987)
17. Seager, S.M.: The double competition number of some triangle-free graphs. Dis-
crete Appl. Math. 28 , 265-269 (1990)
18. Wu, Y., Lu, J.: Dimension-2 poset competition numbers and dimension-2 poset
double competition numbers. Discrete Appl. Math. 158 , 706-717 (2010)
19. Zhao, Y., Chang, G.J.: Multicompetition numbers of some multigraphs. Ars Com-
bin. 97 , 457-469 (2010)