default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Graph Theory, Volume 16
Volume 16, Number 1, March 1992
- Hong Zhang:
Self-complementary symmetric graphs. 1-5 - Chung-Piaw Teo
, Khee Meng Koh:
The number of shortest cycles and the chromatic uniqueness of a graph. 7-15 - Cornelis Hoede:
A characterization of consistent marked graphs. 17-23 - Ralph J. Faudree, Miklós Simonovits:
Ramsey problems and their connection to tuŕan-type extremal problems. 25-50 - Yannis Manoussakis:
Directed hamiltonian graphs. 51-59 - Julie Haviland, Andrew Thomason:
Rotation numers for complete bipartite graphs. 61-71 - A. F. Sidorenko:
On ramsey-tuŕan numbers for 3-graphs. 73-78 - Douglas R. Woodall:
A short proof of a theorem of dirac's about hadwiger's conjecture. 79-80 - Zoltán Füredi:
The maximum number of edges in a minimal graph of diameter 2. 81-98 - Brendan D. McKay, Zhang Ke Min:
The value of the Ramsey number r(3, 8). 99-105
Volume 16, Number 2, June 1992
- Zoltán Füredi, Daniel J. Kleitman:
On zero-trees. 107-120 - Guantao Chen, Richard H. Schelp:
Hamiltonian graphs involving distances. 121-129 - Peter C. Fishburn, William V. Gehrlein:
Niche numbers. 131-139 - Tsuyoshi Nishimura:
A degree condition for the existence of k-factors. 141-151 - Amanda G. Chetwynd, Anthony J. W. Hilton:
Alternating hamiltonian cycles in two colored complete bipartite graphs. 153-158 - Dean G. Hoffman, Christopher A. Rodger:
The chromatic index of complete multipartite graphs. 159-163 - Marietjie Frick:
On replete graphs. 165-175 - Paul A. Catlin:
Supereulerian graphs: A survey. 177-196
Volume 16, Number 3, July 1992
- H. R. Hind:
An upper bound for the total chromatic number of dense graphs. 197-203 - Guo-Hui Zhang:
The maximum valency of regular graphs with given order and odd girth. 205-211 - Neal Brand:
Almost all steinhaus graphs have diameter 2. 213-219 - Wayne Goddard, Michael A. Henning, Henda C. Swart:
Some nordhaus- gaddum-type results. 221-231 - Haitze J. Broersma, Xueliang Li:
The connectivity of the basis graph of a branching greedoid. 233-237 - Quentin Donner:
On the number of list-colorings. 239-245 - Jingzhong Mao:
The structure of geodetic blocks with diameter two. 247-255 - Yair Caro:
On several variations of the turan and ramsey numbers. 257-266 - Ronghua Shi:
2-neighborhoods and hamiltonian conditions. 267-271 - Fan R. K. Chung:
Subgraphs of a hypercube containing no small even cycles. 273-286
Volume 16, Number 4, September 1992
- Seiya Negami:
Projective-planar graphs with even duals. 287-295 - Elefterie Olaru, Eugen Mandrescu:
s-strongly perfect cartesian product of graphs. 297-303 - Hans-Jürgen Bandelt:
Centroids and medians of finite metric spaces. 305-317 - Jorge L. Arocha, Javier Bracho, Victor Neumann-Lara:
On the minimum size of tight hypergraphs. 319-326 - Ralph J. Faudree:
Complete subgraphs with large degree sums. 327-334 - R. Swaminathan, Donald K. Wagner:
Vertex 2-isomorphism. 335-347 - Qinglin Yu:
A note on n-extendable graphs. 349-353 - Jeffrey H. Dinitz, David K. Garnick, András Gyárfás:
On the irregularity strength of the m × n grid. 355-374 - Dragan Marusic, Raffaele Scapellato:
Characterizing vertex-transitive pq-graphs with an imprimitive automorphism subgroup. 375-387
Volume 16, Number 5, November 1992
- Daniel Bienstock, Nathaniel Dean:
New results on rectilinear crossing numbers and plane embeddings. 389-398 - Thomas Zaslavsky:
Orientation embedding of signed graphs. 399-422 - Norbert W. Sauer, X. Zhu:
An approach to hedetniemi's conjecture. 423-436 - Josè Soares:
Maximum diameter of regular digraphs. 437-450 - Lane H. Clark:
The minimum number of subgraphs in a graph and its complement. 451-458 - C. D. Wakelin, Douglas R. Woodall:
Chromatic polynomials, polygon trees, and outerplanar graphs. 459-466 - Tomás Feder:
Product graph representations. 467-488 - Guoli Ding:
Subgraphs and well-quasi-ordering. 489-502 - Roland Häggkvist, Amanda G. Chetwynd:
Some upper bounds on the total and list chromatic numbers of multigraphs. 503-516 - Charles J. Colbourn, Dean G. Hoffman, C. A. Rodger:
Directed star decompositions of the complete directed graph. 517-528
Volume 16, Number 6, December 1992
- Ahmed Ainouche:
An improvement of fraisse's sufficient condition for hamiltonian graphs. 529-543 - Miguel Angel Fiol:
On super-edge-connected digraphs and bipartite digraphs. 545-555 - Xuding Zhu:
Star chromatic numbers and products of graphs. 557-569 - Andreas Huck:
Edge-disjoint paths and cycles in n-edge-connected graphs. 571-589 - Jozef Sirán, Zsolt Tuza:
Nearly uniform distribution of edges among k-subgraphs of a graph. 591-604 - Fan R. K. Chung, Shlomo Sternberg:
Laplacian and vibrational spectra for homogeneous graphs. 605-627 - K. H. Chew, H. P. Yap:
Total chromatic number of complete r-partite graphs. 629-634
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-05 21:03 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:
