default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Theory, Series B, Volume 48
Volume 48, Number 1, February 1990
- Nathaniel Dean:
Distribution of contractible edges in k-connected graphs. 1-5 - David N. Yetter:
On graph invariants given by linear recurrence relations. 6-18 - Chris D. Godsil
, Brendan D. McKay:
Asymptotic enumeration of Latin rectangles. 19-44 - Amanda G. Chetwynd, Anthony J. W. Hilton:
The chromatic index of graphs with large maximum degree, where the number of vertices of maximum degree is relatively small. 45-66 - Robin Thomas:
A menger-like property of tree-width: The finite case. 67-76 - C. P. M. van Hoesel, Alexander Schrijver:
Edge-disjoint homotopic paths in a planar graph with one hole. 77-91 - Pavol Hell, Jaroslav Nesetril:
On the complexity of H-coloring. 92-110 - Douglas Bauer, Edward F. Schmeichel:
Hamiltonian degree conditions which imply a graph is pancyclic. 111-116 - Colin Cooper, Alan M. Frieze:
The limiting probability that alpha-in, ß-out is strongly connected. 117-134 - Ryan B. Hayward, William J. Lenhart:
On the P4-structure of Perfect Graphs. IV. Partner graphs. 135-139 - Ingo Althöfer:
Average distances in undirected graphs and the removal of vertices. 140-142
Volume 48, Number 2, April 1990
- Louis H. Kauffman:
Map coloring and the vector cross product. 145-154 - Carsten Thomassen:
Embeddings of graphs with no short noncontractible cycles. 155-177 - Minoru Numata:
A characterization of Grassmann and Johnson graphs. 178-190 - Douglas A. Leonard:
Directed distance regular graphs with the Q-polynomial property. 191-196 - Reinhard Diestel:
Simplicial tree-decompositions of infinite graphs, I. 197-215 - Yannis Manoussakis:
k-Linked and k-cyclic digraphs. 216-226 - Neil Robertson, Paul D. Seymour:
Graph minors. IV. Tree-width and well-quasi-ordering. 227-254 - Neil Robertson, Paul D. Seymour:
Graph minors. VIII. A kuratowski theorem for general surfaces. 255-288 - Lajos Takács:
A generalization of an inequality of Stepanov. 289-293
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 2025-01-14 21:04 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:
