Digraphs with the path-merging property
暂无分享,去创建一个
[1] Jing Huang,et al. On the Structure of Local Tournaments , 1995, J. Comb. Theory, Ser. B.
[2] Carsten Thomassen,et al. Hamiltonian-connected tournaments , 1980, J. Comb. Theory, Ser. B.
[3] M. Golumbic. Algorithmic graph theory and perfect graphs , 1980 .
[4] Jørgen Bang-Jensen,et al. On the structure of locally semicomplete digraphs , 1992, Discret. Math..
[5] Jørgen Bang-Jensen,et al. Fast Algorithms for Finding Hamiltonian Paths and Cycles in In-Tournament Digraphs , 1993, Discret. Appl. Math..
[6] Jørgen Bang-Jensen,et al. Local Tournaments and Proper Circular Arc Gaphs , 1990, SIGAL International Symposium on Algorithms.
[7] Pavol Hell,et al. Tournament-like oriented graphs , 1992 .
[8] Jørgen Bang-Jensen,et al. Locally semicomplete digraphs: A generalization of tournaments , 1990, J. Graph Theory.
[9] C. Nash-Williams. On Orientations, Connectivity and Odd-Vertex-Pairings in Finite Graphs , 1960, Canadian Journal of Mathematics.
[10] Jørgen Bang-Jensen,et al. In-Tournament Digraphs , 1993, J. Comb. Theory, Ser. B.
[11] Lutz Volkmann,et al. Connectivity properties of locally semicomplete digraphs , 1994, J. Graph Theory.
[12] John E. Hopcroft,et al. The Directed Subgraph Homeomorphism Problem , 1978, Theor. Comput. Sci..