default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Graph Theory, Volume 9
Volume 9, Number 1, Spring 1985
- Jin Akiyama, Mikio Kano:
Factors and factorizations of graphs - a survey. 1-42 - Eric Mendelsohn, Alexander Rosa:
One-factorizations of the complete graph - A survey. 43-65 - Frank Harary, Robert W. Robinson:
Isomorphic factorizations X: Unsolved problems. 67-86 - Hikoe Enomoto, Bill Jackson, P. Katerinis, Akira Saito:
Toughness and the existence of k-factors. 87-95 - Béla Bollobás, Akira Saito, Nicholas C. Wormald:
Regular factors of regular graphs. 97-103 - John Frederick Fink:
On smallest regular graphs with a given isopart. 105-117 - Kiyoshi Ando:
Rao's conjecture on self-complementary graphs with K-factors. 119-121 - Jin Akiyama, Mikio Kano:
Almost-regular factorization of graphs. 123-128 - Mikio Kano:
[a, b]-factorization of a graph. 129-146 - Jeffrey H. Dinitz:
Orthogonal one-factorization graphs. 147-159 - M. V. S. Ramanath:
Factors in a class of regular digraphs. 161-175 - Brian Alspach, Roland Häggkvist:
Some observations on the oberwolfach problem. 177-187 - Sergio Ruiz:
Isomorphic decomposition of complete graphs into linear forests. 189-191 - Anthony J. W. Hilton:
Factorizations of regular graphs of high degree. 193-196 - Jin Akiyama, Peter Frankl:
On the size of graphs with complete-factors. 197-201
Volume 9, Number 2, Summer 1985
- Rüdiger Schmidt:
Almost reconstructing infinite, rayless graphs. 205-211 - Peter J. Slater, S. K. Teo, H. P. Yap:
Packing a tree with a graph of the same size. 213-216 - Peter Frankl:
On the chromatic number of the general Kneser-graph. 217-220 - Yoko Usami:
Extremal graphs of diameter at most 6 after deleting any vertex. 221-234 - Seiya Negami:
Unique and faithful embeddings of projective-planar graphs. 235-243 - Claude Benzaken, Peter L. Hammer, Dominique de Werra:
Threshold characterization of graphs with dilworth number two. 245-267 - Manton M. Matthews, David P. Sumner:
Longest paths and cycles in K1, 3-free graphs. 269-277 - Earl Glen Whitehead Jr.:
Chromaticity of two-trees. 279-284 - Jeffrey E. Steif:
The frame dimension and the complete overlap dimension of a graph. 285-299
Volume 9, Number 3
- Carsten Thomassen:
Gabriel andrew dirac. 301-318 - Martin Farber, B. Richter, H. Shank:
Edge-disjoint spanning trees: A connectedness theorem. 319-324 - Charles Delorme:
Large bipartite graphs with given degree and diameter. 325-334 - Abdelhamid Benhocine, A. Pawel Wojda:
On self-complementation. 335-341 - Ching-Shui Cheng, Joseph C. Masaro, Chi Song Wong:
Do nearly balanced multigraphs have more spanning trees? 335-341 - Jeanette Schmidt-Pruzan, Eli Shamir, Eli Upfal
:
Random hypergraph coloring algorithms and the weak chromatic number. 347-362 - László Babai:
Arc transitive covering digraphs and their eigenvalues. 363-370 - Michael Plantholt:
A generalized construction of chromatic index critical graphs from bipartite graphs. 371-379 - P. J. Owens:
Shortness parameters for planar graphs with faces of only one type. 381-395 - J. Adrian Bondy, László Lovász:
Lengths of cycles in halin graphs. 397-410 - Rainer Bodendiek, Klaus W. Wagner:
On some minimal graphs of the torus. 411-417 - J. I. Hall:
Graphs with constant link and small degree or order. 419-444
Volume 9, Number 4, Winter 1985
- Paul Erdös:
Ulam, the man and the mathematician. 445-449 - Frank Harary, Michael Plantholt:
The graph reconstruction number. 451-454 - Roberto W. Frucht, Reinaldo E. Giudici:
A note on the matching numbers of triangle-free graphs. 455-458 - Peter C. Fishburn, Ronald L. Graham:
Classes of interval graphs under expanding length restrictions. 459-472 - William L. Kocay:
On Stockmeyer's non-reconstructible tournaments. 473-476 - George R. T. Hendry:
On graphs with prescribed median I. 477-481 - Heiko Harborth, Ingrid Mengersen:
An upper bound for the ramsey number r(K5 - e). 483-485 - Dwight Duffus, Bill Sands, Robert E. Woodrow:
On the chromatic number of the product of graphs. 487-495 - Dan Pritikin:
Bichromaticity of bipartite graphs. 497-502 - Abdol-Hossein Esfahanian:
Lower-bounds on the connectivities of a graph. 503-511 - P. Katerinis:
Some conditions for the existence of f-factors. 513-521 - Thomas Andreae:
On superperfect noncomparability graphs. 523-532 - Ernest J. Cockayne, B. Gamble, F. Bruce Shepherd:
An upper bound for the k-domination number of a graph. 533-534 - George Hendry, Walter Vogler:
The square of a connected S(K1, 3)-free graph is vertex pancyclic. 535-537 - Michael Jünger, Gerhard Reinelt, William R. Pulleyblank:
On partitioning the edges of graphs into connected subgraphs. 539-549 - R. D. Cameron, Charles J. Colbourn, Ronald C. Read, Nicholas C. Wormald:
Cataloguing the graphs on 10 vertices. 551-562 - Nicholas C. Wormald:
Enumeration of cyclically 4-connected cubic graphs. 563-573
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-27 20:19 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
