default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Graph Theory, Volume 10
Volume 10, Number 1, Spring 1986
- Kouhei Asano:
The crossing number of K1, 3, n and K2, 3, n. 1-8 - Erik A. van Doorn:
Connectivity of circulant digraphs. 9-14 - Andreas Blass, Bruce E. Sagan:
Bijective proofs of two broken circuit theorems. 15-21 - Hank Jan Veldman:
Existence of spanning and dominating trails and circuits. 23-31 - Derek G. Corneil:
Families of graphs complete for the strong perfect graph Conjecture. 33-40 - Edward A. Bender, L. Bruce Richmond:
Asymptotic enumeration of labeled multigraphs by vertices, edges, and degree parities. 41-46 - Stephen C. Locke
:
Bipartite density and the independence ratio. 47-53 - D. A. Duffus, Denis Hanson:
Minimal k-saturated and color critical graphs of prescribed minimum degree. 55-67 - Ivan Havel, Petr Liebl:
One-legged caterpillars span hypercubes. 69-77 - Madeleine Paoli, W. W. Wong, C. K. Wong:
Minimum k-hamiltonian graphs, II. 79-95 - Michael S. Jacobson, Lael F. Kinch:
On the domination of the products of graphs II: Trees. 97-106 - J. Adrian Bondy, F. Y. Halberstam:
Parity theorems for paths and cycles in graphs. 107-115 - Kiyoshi Ando, Hirobumi Mizuno:
The six bidecomposable graphs. 117-121 - Noga Alon:
The longest cycle of a graph with a large minimal degree. 123-127 - Chong-Yun Chao, Nian-Zu Li, Shao-Ji Xu:
On q-trees. 129-136
Volume 10, Number 2, Summer 1986
- S. Louis Hakimi, Oded Kariv:
A generalization of edge-coloring in graphs. 139-154 - Rachel Manber, Jia-Yu Shao:
On digraphs with the odd cycle property. 155-165 - Claudine Peyrat, Douglas F. Rall, Peter J. Slater:
On iterated clique graphs with increasing diameters. 167-171 - George R. T. Hendry:
Existence of graphs with prescribed mean distance. 173-175 - Dominique de Werra:
Node coverings with odd chains. 177-185 - Lenore J. Cowen, Robert Cowen, Douglas R. Woodall:
Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency. 187-195 - Dan Pritikin:
Applying a proof of tverberg to complete bipartite decompositions of digraphs and multigraphs. 197-201 - L. Kászonyi, Zsolt Tuza:
Saturated graphs with minimal number of edges. 203-210 - Adam Pawel Wojda:
Orientations of hamiltonian cycles in large digraphs. 211-218 - Ignacio Alegre, Miguel Angel Fiol, J. Luis A. Yebra:
Some large graphs with given degree and diameter. 219-224 - F. Göbel, Henk Jan Veldman:
Even graphs. 225-239 - Gek Ling Chia, Chong-Keang Lim:
A class of self-complementary vertex-transitive digraphs. 241-249 - Andrzej Rucinski, Andrew Vince:
Strongly balanced graphs and random graphs. 251-264
Volume 10, Number 3
- Frank Harary:
Editorial: Changing of the guard. i
- Frank Harary:
Graph theory as applied mathematics. iii-iv
- Robin J. Wilson:
An Eulerian trail through Königsberg. 265-275 - Linda M. Lesniak, Ortrud R. Oellermann:
An Eulerian exposition. 277-297 - Nathaniel Dean:
What is the smallest number of dicycles in a dicycle decomposition of an eulerian digraph? 299-308 - Carsten Thomassen:
Reflections on graph theory. 309-324 - Lowell W. Beineke:
Desert island theorems. 325-329 - W. T. Tutte:
From topology to algebra. 331-337 - Francis T. Boesch:
On unreliability polynomials and graph connectivity in reliable network synthesis. 339-352 - Per Hage, Frank Harary:
Some genuine graph models in anthropology. 353-361 - Dan Archdeacon:
The nonorientable genus is additive. 363-383 - Dan Archdeacon:
The orientable genus is nonadditive. 385-401 - Stefan A. Burr:
An inequality involving the vertex arboricity and edge arboricity of a graph. 403-404 - Pierre Fraisse:
A new sufficient condition for hamiltonian graphs. 405-409 - Abdelhamid Benhocine, L. Clark, N. Köhler, Henk Jan Veldman:
On circuits and pancyclic line graphs. 411-425
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-09-22 23:37 CEST 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:
