Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Graph Theory, Volume 12
Volume 12, Number 1, Spring 1988
- Tomasz Luczak
:
On k-leaf connectivity of a random graph. 1-10 - Hong-Jian Lai:
Contractions and hamiltonian line graphs. 11-15 - Lou Caccetta, Paul Erdös, K. Vijayan:
Graphs with unavoidable subgraphs with large degrees. 17-27 - Paul A. Catlin:
A reduction method to find spanning Eulerian subgraphs. 29-44 - Martin Aigner, Eberhard Triesch:
Searching for an edge in a graph. 45-57 - Stanislaw P. Radziszowski, Donald L. Kreher:
Search algorithm for Ramsey graphs by union of group orbits. 59-72 - A. M. H. Gerards:
Homomorphisms of graphs into odd cycles. 73-83 - Madeleine Paoli:
Hamiltonian properties of the cube of a 2-edge connected graph. 85-94 - Katherine Heinrich, Guizhen Liu:
A lower bound on the number of spanning trees with k end-vertices. 95-100 - Carsten Thomassen:
On the presence of disjoint subgraphs of a specified type. 101-111 - Douglas S. Jungreis:
Generalized hamiltonian circuits in the cartesian product of two-directed cycles. 113-120 - Paul Erdös, Mark Goldberg, János Pach, Joel Spencer:
Cutting a graph into two dissimilar halves. 121-131 - Horst Sachs, Michael Stiebitz, Robin J. Wilson:
An historical note: Euler's Königsberg letters. 133-139 - Hikoe Enomoto, Katsuhiro Ota, Mikio Kano:
A sufficient condition for a bipartite graph to have a k-factor. 141-151
Volume 12, Number 2, Summer 1988
- Frank Harary:
In memory of Torrence Parsons, 1941-1987. iii-ii
- Paul Erdös:
A tribute to Torrence Parsons. v-vi
- Torrence D. Parsons, Tomaz Pisanski:
Exotic n-universal graphs. 155-158 - Fan R. K. Chung, Joel E. Cohen, Ronald L. Graham:
Pursuit - Evasion games on graphs. 159-167 - Stephan Olariu:
On the strong perfect graph conjecture. 169-176 - S. Louis Hakimi, Edward F. Schmeichel:
Chromatic factorizations of a graph. 177-182 - Martina Möller, Hans Georg Carstens, Gunnar Brinkmann:
Nowhere-zero flows in low genus graphs. 183-190 - Jan Kratochvíl, Dainis Zeps:
On the number of Hamiltonian cycles in triangulations. 191-194 - André Bouchet:
Transforming trees by successive local complementations. 195-207 - Cun-Quan Zhang:
Hamilton cycles in claw-free graphs. 209-216 - András Gyárfás, Jenö Lehel:
On-line and first fit colorings of graphs. 217-227 - F. R. K. Chung:
The average distance and the independence number. 229-235 - Yongzhi Yang:
The reconstruction conjecture is true if all 2-connected graphs are reconstructible. 237-243 - Paul Vaderlind:
Chromaticity of triangulated graphs. 245-248 - Genghua Fan:
Degree sum for a triangle in a graph. 249-263 - Amram Meir, John W. Moon:
On maximal independent sets of nodes in trees. 265-283 - Zhao Guangfu:
Characterizations of second iterated line graphs. 285-294 - Zbigniew Lonc:
On resolvable tree-decompositions of complete graphs. 295-303
Volume 12, Number 3
- Dan Archdeacon, R. Bruce Richter:
On the parity of crossing numbers. 307-310 - Edward R. Scheinerman:
On the interval number of a chordal graph. 311-316 - Vojislav Petrovic:
Some unavoidable subdigraphs of tournaments. 317-325 - Cui Yuting, Mikio Kano:
Some results on odd factors of graphs. 327-333 - Carsten Thomassen:
Rectilinear drawings of graphs. 335-341 - Clyde L. Monma, Bruce A. Reed, William T. Trotter:
Threshold tolerance graphs. 343-362 - R. Bruce Richter:
Cubic graphs with crossing number two. 363-374 - Daniel Bienstock, Ervin Györi:
Average distance in graphs with removed elements. 375-390 - Chính T. Hoàng, N. Khouzam:
On brittle graphs. 391-404 - Ewald Speckenmeyer:
On feedback vertex sets and nonseparating independent sets in cubic graphs. 405-412 - Henk Jan Veldman:
A result on Hamiltonian line graphs involving restrictions on induced subgraphs. 413-420 - Yukio Shibata:
On the tree representation of chordal graphs. 421-428 - Bill Jackson:
Some remarks on Arc-connectivity, vertex splitting, and orientation in graphs and digraphs. 429-436 - M. Hofmeister:
Counting double covers of graphs. 437-444 - Mark N. Ellingham, László Pyber, Xingxing Yu:
Claw-free graphs are edge reconstructible. 445-451 - Guizhen Liu:
On connectivities of tree graphs. 453-459
Volume 12, Number 4, Winter 1988
- Tomasz Traczyk Jr.:
A dirac-type theorem for squares of graphs. 463-467 - Douglas J. Muder, Margaret Lefevre Weaver, Douglas B. West:
Pagenumber of complete bipartite graphs. 469-489 - George R. T. Hendry:
On minimum degree in Hamiltonian path graphs. 491-497 - Haitze J. Broersma:
Existence of Δλ-cycles and Δλ-paths. 499-507 - Andrew Thomason:
An upper bound for some ramsey numbers. 509-517 - Peter Frankl, János Pach:
An extremal problem on Kr-free graphs. 519-523 - Fred Buckley, Martin Lewinter:
A note on graphs with diameter-preserving spanning trees. 525-528 - Siemion Fajtlowicz:
A characterization of radius-critical graphs. 529-532 - Hans-Jürgen Bandelt, Henry Martyn Mulder:
Regular pseudo-median graphs. 533-549 - Andrew Vince:
Star chromatic number. 551-559 - Robert E. L. Aldred, Sheng Bau, Derek A. Holton, Gordon F. Royle:
An 11-vertex theorem for 3-connected cubic graphs. 561-570 - Victor K. Wei:
A connection between a convex programming problem and the LYM property on perfect graphs. 571-587
a service of 
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-04-18 20:21 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:
