|
1. |
A review of random graphs |
|
Journal of Graph Theory,
Volume 6,
Issue 4,
1982,
Page 349-389
Michał Karoński,
Preview
|
PDF (2235KB)
|
|
摘要:
AbstractThis paper presents a review of results dealing with structural properties and numerical characteristics of random edge‐subgraphs of complete graphs, with the connectedness of random graphs, as well as with random trees and forest
ISSN:0364-9024
DOI:10.1002/jgt.3190060402
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1982
数据来源: WILEY
|
2. |
Nonorientable genus of cartesian products of regular graphs |
|
Journal of Graph Theory,
Volume 6,
Issue 4,
1982,
Page 391-402
Tomaž Pisanski,
Preview
|
PDF (564KB)
|
|
摘要:
AbstractA special type of surgery developed by A. T. White and later used by the author to construct orientable quadrilateral embeddings of Cartesian products of graphs is here expanded to cover the nonorientable case as well. This enables the nonorientable genus of many families of Cartesian products of triangle‐free graphs to be compute
ISSN:0364-9024
DOI:10.1002/jgt.3190060403
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1982
数据来源: WILEY
|
3. |
More rotation numbers for complete bipartite graphs |
|
Journal of Graph Theory,
Volume 6,
Issue 4,
1982,
Page 403-411
Béla Bollobás,
E. J. Cockayne,
Preview
|
PDF (285KB)
|
|
摘要:
AbstractLetGbe a simple undirected graph which haspvertices and is rooted atx. Informally, therotation number h(G, x)of this rooted graph is the minimum number of edges in apvertex graphHsuch that for each vertexvofH, there exists a copy ofGinHwith the rootxatv. In this article we calculate some rotation numbers for complete bipartite graphs, and thus greatly extend earlier results of Cockayne and Lorimer.
ISSN:0364-9024
DOI:10.1002/jgt.3190060404
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1982
数据来源: WILEY
|
4. |
Bounds for the ramsey number of a disconnected graph versus any graph |
|
Journal of Graph Theory,
Volume 6,
Issue 4,
1982,
Page 413-417
Ronald J. Gould,
Michael S. Jacobson,
Preview
|
PDF (199KB)
|
|
摘要:
AbstractBounds are determined for the Ramsey number of the union of graphs versus a fixed graphH, based on the Ramsey number of the components versusH. For certain unions of graphs, the exact Ramsey number is determined. From these formulas, some new Ramsey numbers are indicated. In particular, if.Wherekiis the number of components of orderiandt1(H) is the minimum order of a color class over all critical colorings of the vertices ofH, then.
ISSN:0364-9024
DOI:10.1002/jgt.3190060405
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1982
数据来源: WILEY
|
5. |
Topological subgraphs of cubic graphs and a theorem of dirac |
|
Journal of Graph Theory,
Volume 6,
Issue 4,
1982,
Page 419-427
Richard Statman,
Preview
|
PDF (339KB)
|
|
摘要:
AbstractThe topological subgraph relation between cubic graphs is analyzed. The analysis is then applied to generalize a theorem of Dirac.
ISSN:0364-9024
DOI:10.1002/jgt.3190060406
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1982
数据来源: WILEY
|
6. |
Bipartite graphs with cycles of all even lengths |
|
Journal of Graph Theory,
Volume 6,
Issue 4,
1982,
Page 429-439
Edward Schmeichel,
John Mitchem,
Preview
|
PDF (427KB)
|
|
摘要:
AbstractLetG= (X, Y, E) be a bipartite graph withX=Y=n. Chvátal gave a condition on the vertex degrees ofXandYwhich implies thatGcontains a Hamiltonian cycle. It is proved here that this condition also implies thatGcontains cycles of every even length whenn>3
ISSN:0364-9024
DOI:10.1002/jgt.3190060407
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1982
数据来源: WILEY
|
7. |
A 1‐factorization of the line graphs of complete graphs |
|
Journal of Graph Theory,
Volume 6,
Issue 4,
1982,
Page 441-445
Brian Alspach,
Preview
|
PDF (254KB)
|
|
摘要:
AbstractA 1‐factorization is constructed for the line graph of the complete graphKnwhennis congruent to 0 or 1 modulo
ISSN:0364-9024
DOI:10.1002/jgt.3190060408
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1982
数据来源: WILEY
|
8. |
A new 5‐arc‐transitive cubic graph |
|
Journal of Graph Theory,
Volume 6,
Issue 4,
1982,
Page 447-451
N. L. Biggs,
Preview
|
PDF (188KB)
|
|
摘要:
AbstractA connected cubic graph with 2352 vertices is constructed and is shown to have a group of automorphisms which acts transitively on the 5‐arcs. The construction requires only elementary properties of the Fano plan
ISSN:0364-9024
DOI:10.1002/jgt.3190060409
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1982
数据来源: WILEY
|
9. |
Mean distance for shapes |
|
Journal of Graph Theory,
Volume 6,
Issue 4,
1982,
Page 453-471
J. K. Doyle,
J. E. Graver,
Preview
|
PDF (821KB)
|
|
ISSN:0364-9024
DOI:10.1002/jgt.3190060410
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1982
数据来源: WILEY
|
10. |
Cyclically 5‐edge‐connected cubic planar graphs and shortness coefficients |
|
Journal of Graph Theory,
Volume 6,
Issue 4,
1982,
Page 473-479
P. J. Owens,
Preview
|
PDF (275KB)
|
|
摘要:
AbstractIt is shown that some classes of cyclically 5‐edge‐connected cubic planar graphs with only one type of face besides pentagons contain non‐Hamiltonian members and have shortness coefficients less than
ISSN:0364-9024
DOI:10.1002/jgt.3190060411
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1982
数据来源: WILEY
|
|