共 50 条
- [41] KERNELS IN DIRECTED-GRAPHS - A POISON GAME [J]. DISCRETE MATHEMATICS, 1993, 115 (1-3) : 273 - 276
- [42] DAG - A PROGRAM THAT DRAWS DIRECTED-GRAPHS [J]. SOFTWARE-PRACTICE & EXPERIENCE, 1988, 18 (11): : 1047 - 1062
- [44] SOME PROPERTIES OF DIRECTED-GRAPHS OF DIALOG PROCEDURES [J]. SOVIET JOURNAL OF COMPUTER AND SYSTEMS SCIENCES, 1987, 25 (05): : 124 - 126
- [45] COMPLEXITY OF PROBLEMS RELATIVE TO ACYCLIC DIRECTED-GRAPHS [J]. RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 1987, 21 (02): : 181 - 197
- [47] THE PRIMITIVITY OF THE STRONG PRODUCT OF 2 DIRECTED-GRAPHS [J]. DISCRETE MATHEMATICS, 1993, 121 (1-3) : 145 - 150
- [49] EDGE-DOMATIC NUMBERS OF DIRECTED-GRAPHS [J]. CZECHOSLOVAK MATHEMATICAL JOURNAL, 1995, 45 (03) : 449 - 455
- [50] AN OPTIMAL ALGORITHM FOR CYCLE BREAKING IN DIRECTED-GRAPHS [J]. JOURNAL OF ELECTRONIC TESTING-THEORY AND APPLICATIONS, 1995, 7 (1-2): : 71 - 81