Result 1 to 20 of 298 total
Orientable open domination of graphs. (English)
J. Comb. Math. Comb. Comput. 29, 159-181 (1999).
1
A note on graphs with large girth and small minus domination number. (English)
Discrete Appl. Math. 91, No.1-3, 299-303 (1999).
2
A new proof of a characterization of the set of all geodesics in a connected graph. (English)
Czech. Math. J. 48, No.4, 809-813 (1998).
3
Interpolation theorem for a continuous function on orientations of a simple graph. (English)
Czech. Math. J. 48, No.3, 433-438 (1998).
4
Digraphs contractible onto $^{\ast } K_3$. (English)
Math. Bohem. 123, No.4, 365-369 (1998).
5
Interpolation theorems for a family of spanning subgraphs. (English)
Czech. Math. J. 48, No.1, 45-53 (1998).
6
Total domination edge critical graphs. (English)
Util. Math. 54, 229-240 (1998).
7
Domination in fuzzy graphs. I. (English)
Pattern Recognit. Lett. 19, No.9, 787-791 (1998).
8
Split bondage numbers of a graph. (English)
J. Discrete Math. Sci. Cryptography 1, No.1, 79-84 (1998).
9
Bounds on the weak domination number. (English)
Australas. J. Comb. 18, 245-251 (1998).
10
Domination critical graphs with respect to relative complements. (English)
Australas. J. Comb. 18, 115-126 (1998).
11
Endomorphism classes of ordered sets, graphs and lattices. (English)
Order 15, No.1, 21-34 (1998).
12
Graph-based function representation. Boolean and pseudo-boolean functions. (Graphenbasierte Funktionsdarstellung. Boolesche und Pseudo-Boolesche Funktionen.) (German)
Leitfäden der Informatik. Stuttgart: B. G. Teubner. 200 S. DM 38.00; öS 277.00; sFr. 34.00 (1998).
13
Efficient algorithms for the domination problems on interval and circular-arc graphs. (English)
SIAM J. Comput. 27, No.6, 1671-1694 (1998).
14
The median procedure on median graphs. (English)
Discrete Appl. Math. 84, No.1-3, 165-181 (1998).
15
Edge domination in graphs. (English)
Taiwanese J. Math. 2, No.2, 173-179 (1998).
16
Some results on domination number of products of graphs. (English)
Appl. Math., Ser. B (Engl. Ed.) 13, No.1, 103-108 (1998).
17
Steiner intervals in graphs. (English)
Discrete Appl. Math. 81, No.1-3, 181-190 (1998).
18
The signed and minus $k$-subdomination numbers of comets. (English)
Discrete Math. 183, No.1-3, 141-152 (1998).
19
Graphs critical with respect to the domination number. (English)
Haynes, Teresa W. (ed.) et al., Domination in graphs. Advanced topics. New York, NY: Marcel Dekker. Pure Appl. Math., Marcel Dekker. 209, 439-469 (1998).
20
Result 1 to 20 of 298 total
Start
Contact
Print
General Help
