Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Graph Theory, Volume 13
Volume 13, Number 1, March 1989
- Lutz Volkmann:
Edge-connectivity in p-partite graphs. 1-6 - C. R. J. Clapham, Geoffrey Exoo, Heiko Harborth, Ingrid Mengersen, J. Sheehan:
The ramsey number of k5 - e. 7-15 - Nathaniel Dean, Robert L. Hemminger, Katsuhiro Ota:
Longest cycles in 3-connected graphs contain three contractible edges. 17-21 - Izak Broere, Marieta Burger:
Critically cochromatic graphs. 23-28 - C. R. J. Clapham, A. Flockhart, J. Sheehan:
Graphs without four-cycles. 29-47 - Matthew G. Brin, David E. Rauschenberg, Craig C. Squier:
On the genus of the semidirect product of ℤ9 by ℤ3. 49-61 - Tsuyoshi Nishimura:
Independence number, connectivity, and r-factors. 63-69 - Ron Aharoni, Carsten Thomassen:
Infinite, highly connected digraphs with no two arc-disjoint spanning trees. 71-74 - Leif K. Jørgensen:
Some probabilistic and extremal results on subdivisions and odd subdivisions of graphs. 75-85
- Amanda G. Chetwynd
, Roland Häggkvist:
A note on list-colorings. 87-95
- Geoffrey Exoo:
A lower bound for r(5, 5). 97-98 - David Peleg, Alejandro A. Schäffer:
Graph spanners. 99-116 - David Hartvigsen, Eitan Zemel:
Is every cycle basis fundamental? 117-137
Volume 13, Number 2, June 1989
- Klaus Truemper:
On the delta-wye reduction for planar graphs. 141-148 - Min Aung:
Circumference of a regular graph. 149-155 - Gert Sabidussi:
Paths in bipartite graphs with color-inverting involutions. 157-174 - Avram Zehavi, Alon Itai:
Three tree-paths. 175-188 - Sandip Das, Malay K. Sen, A. B. Roy, Douglas B. West:
Interval digraphs: An analogue of interval graphs. 189-202 - Felix Lazebnik:
On the greatest number of 2 and 3 colorings of a (v, e)-graph. 203-214 - Hans-Jürgen Bandelt:
Graphs with intrinsic s3 convexities. 215-228 - Aart Blokhuis, Andries E. Brouwer:
Locally 4-by-4 grid graphs. 229-244 - George R. T. Hendry:
Ramsey numbers for graphs with five vertices. 245-248 - Mao-cheng Cai:
Common root functions of two digraphs. 249-256 - George R. T. Hendry:
A strengthening of Kikustapos;s theorem. 257-260
Volume 13, Number 3, July 1989
- Stefan A. Burr, Paul Erdös, Ronald L. Graham, Vera T. Sós:
Maximal antiramsey graphs and the strong chromatic number. 263-282 - Richard C. Brewster, Ernest J. Cockayne, Christina M. Mynhardt:
Irredundant ramsey numbers for graphs. 283-290 - Donald G. Beane, Norman L. Biggs, Brian J. Wilson:
The growth rate of the harmonious chromatic number. 291-299 - Stephan Olariu:
A decomposition for strongly perfect graphs. 301-311 - Li Hao:
Edge disjoint cycles in graphs. 313-322 - Denise Amar, Irène Fournier, Anne Germa:
Covering the vertices of a graph by cycles of prescribed length. 323-330 - Nathaniel Dean, Pierre Fraisse:
A degree condition for the circumference of a graph. 331-334 - Terri Lindquester:
The effects of distance and neighborhood union conditions on hamiltonian properties in graphs. 335-352 - Carsten Thomassen, Paul Erdös, Yousef Alavi, Paresh J. Malde, Allen J. Schwenk:
Tight bounds on the chromatic sum of a connected graph. 353-357 - Manoussakis Manolis, Yannis Manoussakis:
The number of bipartite tournaments with a unique given factor. 359-368 - Jenö Lehel:
The minimum number of triangles covering the edges of a graph. 369-384
Volume 13, Number 4, September 1989
- Carol A. Whitehead:
Alternating cycles in edge-colored graphs. 387-391 - Zbigniew Lonc:
Decompositions of graphs into trees. 393-403 - Jeffrey H. Dinitz, Douglas R. Stinson:
Some new perfect one-factorizations from starters in finite fields. 405-415 - Dean G. Hoffman, Charles Curtis Lindner, Christopher A. Rodger:
On the construction of odd cycle systems. 417-426 - Haitze J. Broersma, Cornelis Hoede:
Path graphs. 427-444 - Chính T. Hoàng, Bruce A. Reed:
Some classes of perfectly orderable graphs. 445-463 - Paul A. Catlin:
Double cycle covers and the petersen graph. 465-483 - Cun-Quan Zhang:
Circumference and girth. 485-490 - Joseph A. Gallian:
A survey: Recent results, conjectures, and open problems in labeling graphs. 491-504 - David C. Fisher:
Lower bounds on the number of triangles in a graph. 505-512 - Wolfgang Mader:
On critically connected digraphs. 513-522 - Noga Alon, Paul D. Seymour:
A counterexample to the rank-coloring conjecture. 523-525
Volume 13, Number 5, November 1989
- Augustine M. Moshi:
Matching cutsets in graphs. 527-536 - Shuji Yamada:
An invariant of spatial graphs. 537-551 - Peter J. Lorimer:
The construction of tutte's 8-cage and the conder graph. 553-557 - Jin Akiyama, Hiroshi Era, Severino Villanueva Gervacio, Mamoru Watanabe:
Path chromatic numbers of graphs. 571-573 - Bill Jackson, Robin W. Whitty:
A note concerning graphs with unique f-factors. 577-580 - Malay K. Sen, Sandip Das, Douglas B. West:
Circular-arc digraphs: A characterization. 581-592 - Paul Erdös, Anthony B. Evans:
Representations of graphs and orthogonal latin square graphs. 593-595 - Thomas Wanner:
On the chromaticity of certain subgraphs of a q-tree. 597-605 - Norihide Tokushige:
Binding number and minimum degree for k-factors. 607-617 - Karen Seyffarth:
Maximal planar graphs of diameter two. 619-648
Volume 13, Number 6, December 1989
- Huai-Lu Zhou:
A necessary and sufficient condition for connected, locally k-connected k1, 3-free graphs to be k-hamiltonian. 651-656 - Josep Fàbrega, Miguel Angel Fiol:
Maximally connected digraphs. 657-668 - Jerrold R. Griggs, Daniel J. Kleitman, Aditya Shastri:
Spanning trees with many leaves in cubic graphs. 669-695 - Bert Fassbender:
On longest cycles and strongly linking vertex sets. 697-702 - Frank Harary, Michael Plantholt:
Classification of interpolation theorems for spanning trees and other families of spanning subgraphs. 703-712 - Paul Erdös, Ralph J. Faudree, András Gyárfás, Richard H. Schelp:
Domination in colored complete graphs. 713-718 - Colin Cooper, Alan M. Frieze:
On the number of hamilton cycles in a random graph. 719-735 - Khee Meng Koh, Kee L. Teo:
The 2-hamiltonian cubes of graphs. 737-747 - William McCuaig, F. Bruce Shepherd:
Domination in graphs with minimum degree two. 749-762
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-30 20:57 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:
