E-LIB Suche - Ergebnisse für: CHARTRAND, G.

1

Resolvability and the upper dimension of graphs:

Chartrand, G. ; Poisson, C. ; Zhang, P.
Computers & Mathematics with Applications. 39 (2000) 12 - p. 19-28 , 2000

Link: https://doi.org/10.1016/..

2

On the out-domination and in-domination numbers of a digrap:

Chartrand, G
Discrete Mathematics. 197-198 (1999) 1-3 - p. 179-183 , 1999

Link: https://doi.org/10.1016/..

3

Graph similarity and distance in graphs:

Chartrand, G. ; Kubicki, G. ; Schultz, M.
Aequationes Mathematicae. 55 (1998) 1-2 - p. 129-145 , 1998

Link: https://doi.org/10.1007/..

4

Distance in Digraphs:

Chartrand, G. ; Tian, S.
Computers & Mathematics with Applications. 34 (1997) 11 - p. 15-23 , 1997

Link: https://doi.org/10.1016/..

5

Greatest common divisors and least common multiples of grap..:

Chartrand, G. ; Holley, L. ; Kubicki, G..
Periodica Mathematica Hungarica. 27 (1993) 2 - p. 95-104 , 1993

Link: https://doi.org/10.1007/..

6

A Matter of Degree:

Chartrand, G. ; Hevia, H. ; Oellermann, O...
SIAM Journal on Discrete Mathematics. 2 (1989) 4 - p. 456-466 , 1989

Link: https://doi.org/10.1137/..

7

Variations on a theorem of Petersen:

Bagga, K. S. ; Beineke, L. W. ; Chartrand, G..
Periodica Mathematica Hungarica. 19 (1988) 3 - p. 241-247 , 1988

Link: https://doi.org/10.1007/..

8

The partial complement of graphs:

Chartrand, G. ; Kapoor, S. F. ; Lick, D. R..
Periodica Mathematica Hungarica. 16 (1985) 2 - p. 83-95 , 1985

Link: https://doi.org/10.1007/..

9

Graphs with prescribed degree sets and girth:

Chartrand, G. ; Gould, R. J. ; Kapoor, S. F.
Periodica Mathematica Hungarica. 12 (1981) 4 - p. 261-266 , 1981

Link: https://doi.org/10.1007/..

10

A note on 1-factors in graphs:

Chartrand, G. ; Nebeský, L.
Periodica Mathematica Hungarica. 10 (1979) 1 - p. 41-46 , 1979

Link: https://doi.org/10.1007/..

11

The square of a block is Hamiltonian connected:

Chartrand, G ; Hobbs, Arthur M ; Jung, H.A..
Journal of Combinatorial Theory, Series B. 16 (1974) 3 - p. 290-292 , 1974

Link: https://doi.org/10.1016/..

12

Randomly Traversable Graphs:

CHARTRAND, G. ; White, A.T.
Elemente der Mathematik. 25 (1970) - p. , 1970

Link: http://www.digizeitschri..

13

Line-Coloring of Signed Graphs:

CHARTRAND, G. ; BEHZAD, M.
Elemente der Mathematik. 24 (1969) - p. , 1969

Link: http://www.digizeitschri..

14

The Connectivity of Line-Graphs:

CHARTRAND, G. ; STEWART, M.J.
Mathematische Annalen. 182 (1969) - p. , 1969

Link: http://www.digizeitschri..

15

A generalization of the chromatic number:

Chartrand, G. ; Geller, D. P. ; Hedetniemi, S.
Mathematical Proceedings of the Cambridge Philosophical Society. 64 (1968) 2 - p. 265-271 , 1968

Link: https://doi.org/10.1017/..