Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Theory, Series B, Volume 44
Volume 44, Number 1, February 1988
- Alain Quilliot:
On the problem of how to represent a graph taking into account an additional structure. 1-21 - Richard P. Anstee, Martin Farber:
On bridged graphs and cop-win graphs. 22-28 - Bojan Mohar:
Embeddings of infinite graphs. 29-43 - Charles H. C. Little:
Cubic combinatorial maps. 44-63 - Gary Gordon:
Algebraic characteristic sets of matroids. 64-74 - Peter Horák:
Subgraphs intersecting any hamiltonian cycle. 75-86 - Ron Aharoni:
Matchings in infinite graphs. 87-125
Volume 44, Number 2, April 1988
- François Jaeger:
On Tutte polynomials and cycles of plane graphs. 127-146 - Alan Boshier, Kazumasa Nomura:
A remark on the intersection arrays of distance-regular graphs. 147-153 - Vasek Chvátal, Najiba Sbihi:
Recognizing claw-free perfect graphs. 154-176 - J. Adrian Bondy, Mekkia Kouider:
Hamilton cycles in regular 2-connected graphs. 177-186 - William L. Kocay:
Hypomorphisms, orbits, and reconstruction. 187-200 - Alan Cheung, Henry Crapo:
On relative position in extensions of combinatorial geometries. 201-229 - Alan M. Frieze
:
Finding hamilton cycles in sparse random graphs. 230-250
Volume 44, Number 3, June 1988
- Péter Komjáth, E. C. Milner, Norbert Polat:
A compactness theorem for perfect matchings in matroids. 253-262 - Massimo Ferri, Carlo Gagliardi:
Multiple residues in dimension three. 263-275 - Seiya Negami:
Re-embedding of projective-planar graphs. 276-299 - Jeremy P. Spinrad:
Circular-arc graphs with clique cover number two. 300-306 - Pierre Duchet:
Convex sets in graphs, II. Minimal path convexity. 307-316 - Peter Frankl, Vojtech Rödl, Richard M. Wilson:
The number of submatrices of a given type in a Hadamard matrix and related results. 317-328 - Michael D. Plummer:
Matching extension and the genus of a graph. 329-337 - Martin Loebl, Svatopluk Poljak:
On matroids induced by packing subgraphs. 338-354 - Peter Frankl, Hiroshi Maehara:
The Johnson-Lindenstrauss lemma and the sphericity of some graphs. 355-362 - Edward A. Bender, Robert W. Robinson:
The asymptotic number of acyclic digraphs, II. 363-369 - Yahya Ould Hamidoune, Michel Las Vergnas:
Local edge-connectivity in regular bipartite graphs. 370-371 - Dean G. Hoffman, Christopher A. Rodger:
Class one graphs. 372-376
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:02 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:
