-
2
-
-
38249013099
-
Limit points for average genus I. 3-connected and 2-connected simplicial graphs
-
J. Chen and J.L. Gross, Limit points for average genus I. 3-connected and 2-connected simplicial graphs, J. Combin. Theory B 55 (1992) 83-103.
-
(1992)
J. Combin. Theory B
, vol.55
, pp. 83-103
-
-
Chen, J.1
Gross, J.L.2
-
3
-
-
0039710820
-
Kuratowski-type theorems for average genus
-
J. Chen and J.L. Gross, Kuratowski-type theorems for average genus, J. Combin. Theory B 57 (1993) 100-121.
-
(1993)
J. Combin. Theory B
, vol.57
, pp. 100-121
-
-
Chen, J.1
Gross, J.L.2
-
4
-
-
85044488170
-
A tight lower bound on the maximum genus of a simplicial graph
-
to appear
-
J. Chen, S.P. Kanchi, and J.L. Gross, A tight lower bound on the maximum genus of a simplicial graph, Discrete Math., to appear.
-
Discrete Math.
-
-
Chen, J.1
Kanchi, S.P.2
Gross, J.L.3
-
5
-
-
84986465540
-
Hierarchy of imbedding-distribution invariants of a graph
-
J.L. Gross and M. L. Furst, Hierarchy of imbedding-distribution invariants of a graph, J. Graph Theory 11-2, (1987) 205-220.
-
(1987)
J. Graph Theory
, vol.11
, Issue.2
, pp. 205-220
-
-
Gross, J.L.1
Furst, M.L.2
-
6
-
-
0041912866
-
On the average genus of a graph
-
J.L. Gross, E.W. Klein, and R.G. Rieper, On the average genus of a graph, Graphs and Combinatorics 9, (1993) 153-162.
-
(1993)
Graphs and Combinatorics
, vol.9
, pp. 153-162
-
-
Gross, J.L.1
Klein, E.W.2
Rieper, R.G.3
-
8
-
-
0000757873
-
A characterization of upper embeddable graphs
-
M. Jungerman, A characterization of upper embeddable graphs, Trans. Amer. Math. Soc.241, (1978) 401-406.
-
(1978)
Trans. Amer. Math. Soc.
, vol.241
, pp. 401-406
-
-
Jungerman, M.1
-
10
-
-
0000630428
-
Bounds on number of disjoint spanning trees
-
S. Kundu, Bounds on number of disjoint spanning trees, J. Combinatorial Theory B 17 (1974) 199-203.
-
(1974)
J. Combinatorial Theory B
, vol.17
, pp. 199-203
-
-
Kundu, S.1
-
11
-
-
0001549363
-
A new characterization of the maximum genus of a graph
-
L. Nebesky, A new characterization of the maximum genus of a graph, Czechoslovak Math. J. 31(106) (1981) 604-613.
-
(1981)
Czechoslovak Math. J.
, vol.31
, Issue.106
, pp. 604-613
-
-
Nebesky, L.1
-
12
-
-
0041765429
-
Sur un theoreme min-max en theorie des graphes (d'après L. Nebeský)
-
C. Payan and N.H. Xuong, Sur un theoreme min-max en theorie des graphes (d'après L. Nebeský), Ann. Discrete Math. 17, (1983) 527-533.
-
(1983)
Ann. Discrete Math.
, vol.17
, pp. 527-533
-
-
Payan, C.1
Xuong, N.H.2
-
13
-
-
0003702909
-
-
Addison-Wesley, Menlo Park
-
W.T. Tutte, Graph Theory (Addison-Wesley, Menlo Park, 1984).
-
(1984)
Graph Theory
-
-
Tutte, W.T.1
-
14
-
-
0003488180
-
-
North-Holland, Amsterdam
-
A.T. White, Graphs, Groups, and Surfaces, (North-Holland, Amsterdam, 1984).
-
(1984)
Graphs, Groups, and Surfaces
-
-
White, A.T.1
-
15
-
-
0001213503
-
How to determine the maximum genus of a graph
-
N. H. Xuong, How to determine the maximum genus of a graph, J. Combin. Theory B 26, (1979) 217-225.
-
(1979)
J. Combin. Theory B
, vol.26
, pp. 217-225
-
-
Xuong, N.H.1
|