Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Graph Theory, Volume 29
Volume 29, Number 1, September 1998
- Franz A. Delahan:
Induced embeddings in Steinhaus graphs. 1-9 - Guantao Chen, Jenö Lehel, Michael S. Jacobson, Warren E. Shreve:
Note on graphs without repeated cycle lengths. 11-15 - Bruce L. Bauslaugh:
Tearing a strip off the plane. 17-33 - Tao Jiang, Dhruv Mubayi:
Connectivity and separating sets of cages. 35-44 - Cong Fan, Jiuqiang Liu:
Hamiltonian decompositions of strong products. 45-55
Volume 29, Number 2, October 1998
- Andrew Beveridge, László Lovász:
Random walks and the regeneration time. 57-62 - Jiong-Sheng Li, Zi-Xia Song:
The smallest degree sum that yields potentially Pk-graphical sequences. 63-72 - Linda Eroh, Michelle Schultz:
Matching graphs. 73-86 - Romeo Rizzi:
König's edge coloring theorem without augmenting paths. 87 - Hongbing Fan, Xuding Zhu:
Oriented walk double covering and bidirectional double tracing. 89-102 - David C. Fisher, J. Richard Lundgren, Sarah K. Merz, K. Brooks Reid:
The domination and competition graphs of a tournament. 103-110 - Jørgen Bang-Jensen, Gregory Z. Gutin, Anders Yeo:
A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs. 111-132
Volume 29, Number 3, November 1998
- Baogang Xu:
A sufficient condition for bipartite graphs to be type one. 133-137 - Vadim E. Zverovich:
The ratio of the irredundance number and the domination number for block-cactus graphs. 139-149 - Yair Caro, Raphael Yuster:
The characterization of zero-sum (mod 2) bipartite Ramsey numbers. 151-166 - János Komlós, Gábor N. Sárközy, Endre Szemerédi:
On the Pósa-Seymour conjecture. 167-176 - Kazuhide Hirohata:
Long cycles passing through a specified path in a graph. 177-184 - Jerrold R. Griggs, Miklós Simonovits, George Rubin Thomas:
Extremal graphs with bounded densities of small subgraphs. 185-207
Volume 29, Number 4, December 1998
- Gábor Bacsó, Endre Boros, Vladimir Gurvich, Frédéric Maffray, Myriam Preissmann:
On minimal imperfect graphs with circular symmetry. 209-225 - Hajo Broersma, Hilde Tuinstra:
Independence trees and Hamilton cycles. 227-237 - Joël Puech:
Irredundance perfect and P6-free graphs. 239-255 - Keith Edwards:
A new upper bound for the harmonious chromatic number. 257-261 - Jan van den Heuvel, R. A. Leese, M. A. Shepherd:
Graph labeling and radio channel assignment. 263-283
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-05-10 18:48 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:
