Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Graph Theory, Volume 30
Volume 30, Number 1, January 1999
- Xuding Zhu:
Construction of uniquely H-colorable graphs. 1-6 - Qi Zhang Liu, H. P. Yap:
Proof of a conjecture of Alan Hartman. 7-17 - Xuding Zhu:
A simple proof of Moser's theorem. 19-26 - Stefan Grünewald, Eckhard Steffen:
Chromatic-index-critical graphs of even order. 27-36 - Tommy R. Jensen, Gordon F. Royle:
Hajós constructions of critical graphs. 37-50 - Manoel Lemos, James G. Oxley:
On removable circuits in graphs and matroids. 51-66 - D. J. Guan, Xuding Zhu:
Game chromatic number of outerplanar graphs. 67-70
Volume 30, Number 2, February 1999
- Mark Ginn:
Forbidden ordered subgraph vs. forbidden subgraph characterizations of graph classes. 71-76 - Bruce P. Mull:
Enumerating the orientable 2-cell imbeddings of complete bipartite graphs. 77-90 - Akira Saito:
Long paths, long cycles, and their relative length. 91-99 - Peter Hamburger, Alexandr V. Kostochka, Alexander F. Sidorenko:
Hypercube subgraphs with local detours. 101-111 - Nadimpalli V. R. Mahadev, Bruce A. Reed:
A note on vertex orders for stability number. 113-120 - Uri N. Peled, Julin Wu:
Restricted unimodular chordal graphs. 121-136 - Markus Meringer:
Fast generation of regular graphs and construction of cages. 137-146 - Richard P. Anstee, Yunsun Nam:
Convexity of degree sequences. 147-156
Volume 30, Number 3, March 1999
- Jorge L. Arocha, Joaquín Tey:
The size of minimum 3-trees: Cases 3 and 4 mod 6. 157-166 - Xiaoyun Lu, Da-Wei Wang, Gerard J. Chang, In-Jen Lin, C. K. Wong:
On k-ary spanning trees of tournaments. 167-176 - Mirko Hornák
, Stanislav Jendrol':
On a conjecture by Plummer and Toft. 177-189 - Hikoe Enomoto, Katsuhiro Ota:
Connected subgraphs with small degree sums in 3-connected planar graphs. 191-203 - Gyula Y. Katona, Hal A. Kierstead:
Hamiltonian chains in hypergraphs. 205-212 - Torsten Thiele:
A lower bound on the independence number of arbitrary hypergraphs. 213-221 - Atsuhiro Nakamoto:
Generating quadrangulations of surfaces with minimum degree at least 3. 223-234 - Jinquan Dong:
On the diameter of i-center in a graph without long induced paths. 235-241 - Mekkia Kouider, Peter Winkler:
Erratum: Mean distance and minimum degree. 243
Volume 30, Number 4, April 1999
- Daphne Der-Fen Liu, Xuding Zhu:
Distance graphs with missing multiples in the distance sets. 245-259 - Wolfgang Mader:
An extremal problem for subdivisions of K. 261-276 - Hong-Jian Lai:
Extending a partial nowhere-zero 4-flow. 277-288 - Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic:
Even and odd holes in cap-free graphs. 289-308 - Van Bang Le:
A good characterization of cograph contractions. 309-318 - Stephen C. Locke, Dave Witte:
On non-Hamiltonian circulant digraphs of outdegree three. 319-331
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-22 20:03 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:
