default search action
Journal of Graph Theory, Volume 19
Volume 19, Number 1, January 1995
- Roman Nedela, Martin Skoviera:
Which generalized petersen graphs are cayley graphs? 1-11 - Yuansheng Yang, George R. T. Hendry:
The ramsey number r(k1 + c4, k5 - e). 13-15 - Peter Brass
, Heiko Harborth, Hauke Nienborg:
On the maximum number of edges in a c4-free subgraph of qn. 17-23 - Norbert Polat:
Retract-collapsible graphs and invariant subgraph properties. 25-44 - Thomas Niessen:
Neighborhood unions and regular factors. 45-64 - Alexandr V. Kostochka:
The 7/5-conjecture strengthens itself. 65-67 - Michael R. Pinter:
A class of planar well-covered graphs with girth four. 69-81 - Ernest J. Cockayne, Christina M. Mynhardt
Total dominating functions in trees: Minimality and convexity. 83-92 - Saad I. El-Zanati, Michael Plantholt, Shailesh K. Tipnis:
Factorization of regular multigraphs into regular graphs. 93-105 - Tommy R. Jensen, Gordon F. Royle
Small graphs with chromatic number 5: A computer search. 107-116 - Mieczyslaw Borowiecki, Jaroslav Ivanco, Peter Mihók, Gabriel Semanisin
Sequences realizable by maximal k-degenerate graphs. 117-124 - Alice M. Dean, R. Bruce Richter:
The crossing number of c4 × c4. 125-129 - Genghua Fan:
Path covers of weighted graphs. 131-136
Volume 19, Number 2, March 1995
- Mao-cheng Cai, Herbert Fleischner:
An eulerian trail traversing specified edges in given order. 137-144 - Sandi Klavzar
Coloring graph bundles. 145-155 - Bill Jackson:
Cycles through vertices of large maximum degree. 157-168 - C. A. Rodger, Evan B. Wantland:
Embedding edge-colorings into 2-edge-connected k-factorizations of kkn+1. 169-185 - Katherine Heinrich, Peter Horák:
Isomorphic factorizations of trees. 187-199 - Alexander Rosa, Jozef Sirán:
Bipartite labelings of trees and the gracesize. 201-215 - David C. Fisher, Jennifer Ryan:
Tournament games and positive tournaments. 217-236 - Dan Archdeacon, C. Paul Bonnington
An algebraic characterization of planar graphs. 237-250 - Gek Ling Chia:
On the join of graphs and chromatic uniqueness. 251-261 - Guantao Chen, Cecil C. Rousseau:
The irredundant ramsey number s(3, 7). 263-270 - Chính T. Hoàng:
On the two-edge-colorings of perfect graphs. 271-279
Volume 19, Number 3, May 1995
- Jianer Chen, Jonathan L. Gross, Robert G. Rieper:
Lower bounds for the average genus. 281-296 - Leizhen Cai:
Path decompositions of multigraphs. 297-307 - Brendan D. McKay, Stanislaw P. Radziszowski:
R(4, 5) = 25. 309-322 - Gábor N. Sárközy:
Cycles in bipartite graphs and an application in number theory. 323-331 - Frank K. Hwang:
An isomorphic factorization of the complete graph. 333-337 - Xiang-Ying Su:
Paths, cycles, and arc-connectivity in digraphs. 339-351 - Chi Wang:
Competitive inheritance and limitedness of graphs. 353-366 - Weizhen Gu, K. B. Reid, Walter Schnyder:
Realization of digraphs by preferences based on distances in graphs. 367-373 - Robert Molina:
The edge reconstruction number of a disconnected graph. 375-384 - Hong-Jian Lai:
The size of graphs without nowhere-zero 4-flows. 385-395 - Ralph J. Faudree, Ronald J. Gould, Linda M. Lesniak, Terri Lindquester:
Generalized degree conditions for graphs with bounded independence number. 397-409 - Michael Larsen, James Gary Propp, Daniel Ullman:
The fractional chromatic number of mycielski's graphs. 411-416 - Peter Bugata, Attila Nagy, Roman Vávra:
A polynomial time algorithm recognizing link trees. 417-433
Volume 19, Number 4, July 1995
- Ira M. Gessel, Bruce E. Sagan, Yeong-Nan Yeh:
Enumeration of trees by inversions. 435-459 - Michael S. Jacobson, André E. Kézdy
The 2-intersection number of paths and bounded-degree trees. 461-469 - Roland Häggkvist, Andrew Thomason:
Oriented hamilton cycles in digraphs. 471-479 - Gregory Z. Gutin:
Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: a survey. 481-505 - Oleg V. Borodin:
A new proof of the 6 color theorem. 507-521 - A. Sakaloglu, Appajosyula Satyanarayana:
Graphs with least number of colorings. 523-533 - Ephraim Korach, Zvi Ostfeld:
On the existence of special depth first search trees. 535-547 - Bhalchandra D. Thatte:
Some results on the reconstruction problems. p-claw-free, chordal, and p4-reducible graphs. 549-561
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-15 19:22 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: