Ulam, the man and the mathematician.
- Published in:
- Journal of Graph Theory, 1985, v. 9, n. 4, p. 445, doi. 10.1002/jgt.3190090402
- By:
- Publication type:
- Article
Works matching IS 03649024 AND DT 1985 AND VI 9 AND IP 4
Results: 18
1
2
On superperfect noncomparability graphs.
- Published in:
- Journal of Graph Theory, 1985, v. 9, n. 4, p. 523, doi. 10.1002/jgt.3190090413
- By:
- Publication type:
- Article
3
On Stockmeyer's non-reconstructible tournaments.
- Published in:
- Journal of Graph Theory, 1985, v. 9, n. 4, p. 473, doi. 10.1002/jgt.3190090406
- By:
- Publication type:
- Article
4
Cataloguing the graphs on 10 vertices.
- Published in:
- Journal of Graph Theory, 1985, v. 9, n. 4, p. 551, doi. 10.1002/jgt.3190090417
- By:
- Publication type:
- Article
5
Masthead.
- Published in:
- Journal of Graph Theory, 1985, v. 9, n. 4, p. fmi, doi. 10.1002/jgt.3190090401
- Publication type:
- Article
6
Some conditions for the existence of f-factors.
- Published in:
- Journal of Graph Theory, 1985, v. 9, n. 4, p. 513, doi. 10.1002/jgt.3190090412
- By:
- Publication type:
- Article
7
Classes of interval graphs under expanding length restrictions.
- Published in:
- Journal of Graph Theory, 1985, v. 9, n. 4, p. 459, doi. 10.1002/jgt.3190090405
- By:
- Publication type:
- Article
8
On partitioning the edges of graphs into connected subgraphs.
- Published in:
- Journal of Graph Theory, 1985, v. 9, n. 4, p. 539, doi. 10.1002/jgt.3190090416
- By:
- Publication type:
- Article
9
On the chromatic number of the product of graphs.
- Published in:
- Journal of Graph Theory, 1985, v. 9, n. 4, p. 487, doi. 10.1002/jgt.3190090409
- By:
- Publication type:
- Article
10
Lower-bounds on the connectivities of a graph.
- Published in:
- Journal of Graph Theory, 1985, v. 9, n. 4, p. 503, doi. 10.1002/jgt.3190090411
- By:
- Publication type:
- Article
11
A note on the matching numbers of triangle-free graphs.
- Published in:
- Journal of Graph Theory, 1985, v. 9, n. 4, p. 455, doi. 10.1002/jgt.3190090404
- By:
- Publication type:
- Article
12
The square of a connected S(K<sub>1,3</sub>)-free graph is vertex pancyclic.
- Published in:
- Journal of Graph Theory, 1985, v. 9, n. 4, p. 535, doi. 10.1002/jgt.3190090415
- By:
- Publication type:
- Article
13
An upper bound for the ramsey number r(K<sub>5</sub> − e).
- Published in:
- Journal of Graph Theory, 1985, v. 9, n. 4, p. 483, doi. 10.1002/jgt.3190090408
- By:
- Publication type:
- Article
14
Bichromaticity of bipartite graphs.
- Published in:
- Journal of Graph Theory, 1985, v. 9, n. 4, p. 497, doi. 10.1002/jgt.3190090410
- By:
- Publication type:
- Article
15
The graph reconstruction number.
- Published in:
- Journal of Graph Theory, 1985, v. 9, n. 4, p. 451, doi. 10.1002/jgt.3190090403
- By:
- Publication type:
- Article
16
An upper bound for the k-domination number of a graph.
- Published in:
- Journal of Graph Theory, 1985, v. 9, n. 4, p. 533, doi. 10.1002/jgt.3190090414
- By:
- Publication type:
- Article
17
On graphs with prescribed median I.
- Published in:
- Journal of Graph Theory, 1985, v. 9, n. 4, p. 477, doi. 10.1002/jgt.3190090407
- By:
- Publication type:
- Article
18
Enumeration of cyclically 4-connected cubic graphs.
- Published in:
- Journal of Graph Theory, 1985, v. 9, n. 4, p. 563, doi. 10.1002/jgt.3190090418
- By:
- Publication type:
- Article