Result 1 to 20 of 66 total
Polyhedral consequences of the amalgam operation. (English)
Discrete Math. 130, No.1-3, 39-55 (1994).
1
The complexity of domination problems in circle graphs. (English)
Discrete Appl. Math. 42, No.1, 51-63 (1993).
2
General vertex disjoint paths in series-parallel graphs. (English)
Discrete Appl. Math. 41, No.2, 147-164 (1993).
3
The binding number of trees and $K(1,3)$-free graphs. (English)
J. Comb. Math. Comb. Comput. 7, 193-200 (1990).
4
Computing the binding number of a graph. (English)
Discrete Appl. Math. 27, No.3, 283-285 (1990).
5
On cycle cones and polyhedra. (English)
Linear Algebra Appl. 114-115, 613-640 (1989).
6
Locally 4-by-4 grid graphs. (English)
J. Graph Theory 13, No.2, 229-243 (1989).
7
Characterization of nth line digraphs. (English)
Numerical mathematics and computing, Proc. 18th Manitoba Conf., Winnipeg/Can. 1988, Congr. Numerantium, 69, 147-156 (1989).
8
Computational considerations for exclusive (M,N)-transitive augmentations. (English)
J. Comb. Math. Comb. Comput. 5, 55-60 (1989).
9
On Hallian digraphs and their binding number. (English)
Combinatorics and graph theory, Proc. 30th Semester, Warsaw/Pol. 1987, Banach Cent. Publ. 25, 33-37 (1989).
10
The binding number of pseudobivariegated trees. (English)
Graphs, hypergraphs and matroids III, Proc. 7th Reg. Sci. Sess. Math., Kalsk/Pol. 1988, 75-84 (1989).
11
An optimization problem in the scheduling of round-robin tournaments. (English)
Combinatorics, graph theory, and computing, Proc. 19th Southeast. Conf., Boca Raton/Fla. 1988, Congr. Numerantium 65, 229-236 (1988).
12
Notes on $(M,N,R\sb 1,R\sb 2)$-transitive directed graphs. (English)
Combinatorics, graph theory, and computing, Proc. 19th Southeast. Conf., Boca Raton/Fla. 1988, Congr. Numerantium 65, 51-68 (1988).
13
Tournament ranking with expected profit in polynomial time. (English)
SIAM J. Discrete Math. 1, No.3, 372-376 (1988).
14
The bandwidth of theta graphs. (English)
Util. Math. 33, 9-22 (1988).
15
Linear algorithms for the dominating cycle problems in series-parallel graphs, partial k-trees, and Halin graphs. (English)
Numerical mathematics and computing, Proc. 16th Conf., Winnipeg/Manit. 1986, Congr. Numerantium 57, 289-298 (1987).
16
Reducing prime graphs and recognizing circle graphs. (English)
Combinatorica 7, 243-254 (1987).
17
Discrete integral geometry. (English)
Computer analysis of images and patterns, Proc. 2nd Int. Conf., CAIP ’87, Wismar/GDR 1987, Math. Res. 40, 209-212 (1987).
18
The three basic formulas of neighborhood structures. (English)
Computer analysis of images and patterns, Proc. 2nd Int. Conf. CAIP ’87, Wismar/GDR 1987, Math. Res. 40, 149-161 (1987).
19
An algorithm for detecting symmetries in drawings. (English)
Ars Comb. 23A, 95-104 (1987).
20
Result 1 to 20 of 66 total
Start
Contact
Print
General Help
