Masthead.
- Published in:
- Journal of Graph Theory, 1981, v. 5, n. 2, p. fmi, doi. 10.1002/jgt.3190050201
- Publication type:
- Article
Works matching IS 03649024 AND DT 1981 AND VI 5 AND IP 2
Results: 13
1
2
A note on path and cycle decompositions of graphs.
- Published in:
- Journal of Graph Theory, 1981, v. 5, n. 2, p. 209, doi. 10.1002/jgt.3190050212
- By:
- Publication type:
- Article
3
A construction of chromatic index critical graphs.
- Published in:
- Journal of Graph Theory, 1981, v. 5, n. 2, p. 159, doi. 10.1002/jgt.3190050205
- By:
- Publication type:
- Article
4
Hamiltonian groups are color-graph-hamiltonian.
- Published in:
- Journal of Graph Theory, 1981, v. 5, n. 2, p. 197, doi. 10.1002/jgt.3190050209
- By:
- Publication type:
- Article
5
Every connected, locally connected graph is upper embeddable.
- Published in:
- Journal of Graph Theory, 1981, v. 5, n. 2, p. 205, doi. 10.1002/jgt.3190050211
- By:
- Publication type:
- Article
6
Long paths and cycles in oriented graphs.
- Published in:
- Journal of Graph Theory, 1981, v. 5, n. 2, p. 145, doi. 10.1002/jgt.3190050204
- By:
- Publication type:
- Article
7
Counting the 10-point graphs by partition.
- Published in:
- Journal of Graph Theory, 1981, v. 5, n. 2, p. 183, doi. 10.1002/jgt.3190050208
- By:
- Publication type:
- Article
8
A graph which is edge transitive but not arc transitive.
- Published in:
- Journal of Graph Theory, 1981, v. 5, n. 2, p. 201, doi. 10.1002/jgt.3190050210
- By:
- Publication type:
- Article
9
On the theory of the matching polynomial.
- Published in:
- Journal of Graph Theory, 1981, v. 5, n. 2, p. 137, doi. 10.1002/jgt.3190050203
- By:
- Publication type:
- Article
10
Pseudosimilar vertices in a graph.
- Published in:
- Journal of Graph Theory, 1981, v. 5, n. 2, p. 171, doi. 10.1002/jgt.3190050207
- By:
- Publication type:
- Article
11
On the reconstruction of locally finite trees.
- Published in:
- Journal of Graph Theory, 1981, v. 5, n. 2, p. 123, doi. 10.1002/jgt.3190050202
- By:
- Publication type:
- Article
12
On strongly regular self - complementary graphs.
- Published in:
- Journal of Graph Theory, 1981, v. 5, n. 2, p. 213, doi. 10.1002/jgt.3190050213
- By:
- Publication type:
- Article
13
An upper bound on the size of the largest cliques in a graph.
- Published in:
- Journal of Graph Theory, 1981, v. 5, n. 2, p. 165, doi. 10.1002/jgt.3190050206
- By:
- Publication type:
- Article