Result 1 to 20 of 177 total
On the structure of graphs with a unique $k$-factor. (English)
J. Graph Theory 35, No.4, 227-243 (2000).
1
Graph theory. (Graphentheorie.) 2., neu bearb. und erw. Aufl. (German)
Berlin: Springer. xvi, 314 S. DM 59.00; öS 431.00; sFr. 54.00; \sterling 20.50; \$ 31.90 (2000).
2
Wojcicka’s theorem: Complete, consolidated proof. (English)
J. Comb. Math. Comb. Comput. 33, 129-179 (2000).
3
Stability measure of a graph: A survey. (English)
Util. Math. 57, 171-191 (2000).
4
Multiple vertex coverings by specified induced subgraphs. (English)
J. Graph Theory 34, No.2, 180-190 (2000).
5
On cliques and bicliques. (English)
J. Graph Theory 34, No.1, 60-66 (2000).
6
Vertex-neighbor-integrity of magnifiers, expanders, and hypercubes. (English)
Discrete Math. 216, No.1-3, 257-266 (2000).
7
On the neighbour-integrity of sequential joined graphs. (English)
Int. J. Comput. Math. 74, No.1, 45-52 (2000).
8
On Hering decomposition of DK$_n$ induced by group actions on conjugacy classes. (English)
Eur. J. Comb. 21, No.3, 379-393 (2000).
9
$α$-domination. (English)
Discrete Math. 211, No.1-3, 11-26 (2000).
10
Restrained domination in trees. (English)
Discrete Math. 211, No.1-3, 1-9 (2000).
11
A result on the prime labelings of trees. (English)
Bull. Inst. Comb. Appl. 28, 36-38 (2000).
12
Some polynomials associated with up-down permutations. (English)
Discrete Math. 210, No.1-3, 117-136 (2000).
13
Rank independent domination for trees. (English)
Bull. Inst. Comb. Appl. 27, 62-68 (1999).
14
The average Wiener index of hexagonal chains. (English)
Comput. Chem. 23, No.6, 571-576 (1999).
15
The Tutte polynomial as a growth function. (English)
J. Algebr. Comb. 10, No.2, 115-133 (1999).
16
Regular honest graphs, isoperimetric numbers, and bisection of weighted graphs. (English)
Eur. J. Comb. 20, No.6, 469-481 (1999).
17
On edge-integrity maximal graphs. (English)
J. Comb. Math. Comb. Comput. 30, 237-250 (1999).
18
Vulnerability in graphs—a comparative survey. (English)
J. Comb. Math. Comb. Comput. 30, 23-31 (1999).
19
Augmenting hypergraphs by edges of size two. (English)
Math. Program. 84, No.3 (B), 467-481 (1999).
20
Result 1 to 20 of 177 total
Start
Contact
Print
General Help
