History

Please fill in your query. A complete syntax description you will find on the General Help page.
first | previous | 1 21 41 61 81 | next | last

Result 1 to 20 of 95 total

Niche number four. (English)
Comput. Math. Appl. 32, No.9, 51-54 (1996).
1
Large subgraphs of minimal density or degree. (English)
J. Comb. Math. Comb. Comput. 22, 87-96 (1996).
2
Disproof of a conjecture about independent branchings in $k$-connected directed graphs. (English)
J. Graph Theory 20, No.2, 235-239 (1995).
3
A sharp lower bound for the circumference of 1-tough graphs with large degree sums. (English)
J. Graph Theory 20, No.2, 137-140 (1995).
4
Toughness and spectrum of a graph. (English)
Linear Algebra Appl. 226-228, 267-271 (1995).
5
An extremal result for subgraphs with few edges. (English)
J. Comb. Theory, Ser. B 64, No.2, 288-299 (1995).
6
A generalization of Menger’s theorem for certain block-cactus graphs. (English)
Graphs Comb. 11, No.1, 49-52 (1995).
7
Total dominating functions in trees: Minimality and convexity. (English)
J. Graph Theory 19, No.1, 83-92 (1995).
8
An upper bound for orders of certain $(k,\bar k)$-connected graphs. (English)
Discrete Math. 135, No.1-3, 371-375 (1994).
9
Edge domatic numbers of complete $n$-partite graphs. (English)
Graphs Comb. 10, No.3, 241-248 (1994).
10
Independence numbers of product graphs. (English)
Appl. Math. Lett. 7, No.4, 91-94 (1994).
11
Australas. J. Comb. 9, 275-284 (1994).
12
The 3-connected graphs with a Hamilton path containing precisely two contractible edges. (English)
Congr. Numerantium 97, 209-222 (1993).
13
Niche graphs and unit interval graphs. (English)
Congr. Numerantium 93, 83-90 (1993).
14
Note on the domination number of a graph. (English)
Demonstr. Math. 26, No.1, 103-105 (1993).
15
Some algebraic constructions of dense graphs of large girth and of large size. (English)
Friedman, Joel (ed.), Expanding graphs. Proceedings of the DIMACS workshop on expander graphs, May 11-14, 1992, Princeton University, NJ (USA). Providence, RI: American Mathematical Society. DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 10, 75-93 (1993).
16
Minimal clique partitions of norm three. II. (English)
Rees, Rolf S. (ed.), Graphs, matrices, and designs. Festschrift in honor of Norman J. Pullman. New York: Marcel Dekker, Inc.. Lect. Notes Pure Appl. Math. 139, 279-294 (1993).
17
Extremal problems for the Bondy-Chvátal closure of a graph. (English)
Rees, Rolf S. (ed.), Graphs, matrices, and designs. Festschrift in honor of Norman J. Pullman. New York: Marcel Dekker, Inc. Lect. Notes Pure Appl. Math. 139, 73-83 (1993).
18
Eigenvalues of finite graphs. (English)
Discrete Math. 114, No.1-3, 137-146 (1993).
19
On the Berge’s strong path partition conjecture. (English)
Discrete Math. 112, No.1-3, 289-293 (1993).
20
first | previous | 1 21 41 61 81 | next | last

Result 1 to 20 of 95 total