History
1
66
Year:
-
Type:
Journal
Book
Article
Please fill in your query. A complete syntax description you will find on the General Help page.
first | previous | 1 21 41 61 | next | last

Result 1 to 20 from 66 total

Vertex-disjoint claws in graphs. (English)
Discrete Math. 197-198, 225-246 (1999).
1
$P_4$-domination in minimal imperfect graphs. (English)
Discrete Appl. Math. 94, No.1-3, 329-336 (1999).
2
Approximating bandwidth by mixing layouts of interval graphs. (English)
Meinel, Christoph (ed.) et al., STACS 99. 16th annual symposium on Theoretical aspects of computer science, Trier, Germany, March 4-6, 1999. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1563, 248-258 (1999).
3
Integral sum numbers of cocktail party graphs and symmetric complete bipartite graphs. (English)
Bull. Inst. Comb. Appl. 25, 23-28 (1999).
4
Domination in products of circuits. (English)
Acta Univ. M. Belii, Ser. Math. 6, 57-62 (1998).
5
Minimal oriented graphs of diameter 2. (English)
Graphs Comb. 14, No.4, 345-350 (1998).
6
An efficient algorithm for minimum-weight bibranching. (English)
J. Comb. Theory, Ser. B 73, No.2, 130-145 (1998).
7
Packing, perfect neighbourhood, irredundant and $R$-annihilated sets in graphs. (English)
Australas. J. Comb. 18, 253-262 (1998).
8
Closed neighborhood order dominating functions. (English)
Australas. J. Comb. 17, 77-88 (1998).
9
Australas. J. Comb. 17, 39-49 (1998).
10
Independence, domination, irredundance, and forbidden pairs. (English)
J. Comb. Math. Comb. Comput. 26, 193-212 (1998).
11
Real domination in graphs. (English)
J. Comb. Math. Comb. Comput. 26, 147-160 (1998).
12
Efficient and excess domination in graphs. (English)
J. Comb. Math. Comb. Comput. 26, 83-95 (1998).
13
On the double competition number. (English)
Discrete Appl. Math. 82, No.1-3, 251-255 (1998).
14
Harper-type lower bounds and the bandwidths of the compositions of graphs. (English)
Discrete Math. 181, No.1-3, 255-266 (1998).
15
Bipartite subgraphs of integer weighted graphs. (English)
Discrete Math. 181, No.1-3, 19-29 (1998).
16
On decomposition of triangle-free graphs under degree constraints. (English)
J. Graph Theory 27, No.1, 7-9 (1998).
17
Eulerian subgraphs containing given vertices and hamiltonian line graphs. (English)
Discrete Math. 178, No.1-3, 93-107 (1998).
18
Independence, domination and generalized maximum degree. (English)
Congr. Numerantium 125, 145-152 (1997).
19
Weighted parameters in $(P_5,\overline {P_5})$-free graphs. (English)
Discrete Appl. Math. 80, No.2-3, 255-261 (1997).
20
first | previous | 1 21 41 61 | next | last

Result 1 to 20 from 66 total