Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Theory, Series B, Volume 36
Volume 36, Number 1, February 1984
- Wilfried Imrich
, J. M. S. Simões-Pereira, Christina Zamfirescu:
On optimal embeddings of metrics in graphs. 1-15 - Nathan Linial:
Graph decompositions without isolates. 16-25 - Paul H. Edelman:
The acyclic sets of an oriented matroid. 26-31 - Jean-Claude Bermond, Charles Delorme, G. Farhi:
Large graphs with given degree and diameter. II. 32-48 - Neil Robertson, Paul D. Seymour:
Graph minors. III. Planar tree-width. 49-64 - Peter Hoffman, R. Bruce Richter:
Embedding graphs in surfaces. 65-84 - Tomio Hirata, Kiyohito Kubota, Osami Saito:
A sufficient condition for a graph to be weakly k-linked. 85-94 - Tiong-Seng Tay:
Rigidity of multi-graphs. I. Linking rigid bodies in n-space. 95-112 - Ron Aharoni:
Matchings in graphs of size N1. 113-117 - Yanpei Liu:
On the number of rooted c-nets. 118-123
Volume 36, Number 2, April 1984
- Anthony J. W. Hilton:
Hamiltonian decompositions of complete graphs. 125-134 - Václav Koubek, Vojtech Rödl:
On the minimum order of graphs with given semigroup. 135-155 - Henry A. Kierstead:
On the chromatic index of multigraphs without large triangles. 156-160 - William H. Cunningham:
Testing membership in matroid polyhedra. 161-188 - Seiya Negami:
Uniquely and faithfully embeddable projective-planar triangulations. 189-193 - Albert L. Wells Jr.:
Even signings, signed switching classes, and (-1, 1)-matrices. 194-212 - Luis Montejano, Victor Neumann-Lara:
A variation of Menger's theorem for long paths. 213-217 - Han-Kun Ma:
A counterexample to the conjecture of Aksionov and Mel'nikov on non-3-colorable planar graphs. 218-219
Volume 36, Number 3, June 1984
- András Frank:
Finding feasible vectors of Edmonds-Giles polyhedra. 221-239 - Peter M. Gibson:
A bound for the number of tournaments with specified scores. 240-243 - Thomas W. Tucker:
A refined Hurwitz theorem for imbeddings of irredundant Cayley graphs. 244-268 - Thomas W. Tucker:
There is one group of genus two. 269-275 - Edward A. Bender, L. Bruce Richmond:
The asymptotic enumeration of rooted convex polyhedra. 276-283 - Ján Plesník:
A construction of geodetic graphs based on pulling subgraphs homeomorphic to complete graphs. 284-297 - Michael O. Albertson, Karen L. Collins:
Duality and perfection for edges in cliques. 298-309
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-17 20:30 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:
