Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Theory, Series B, Volume 45
Volume 45, Number 1, August 1988
- Alain Hertz:
Bipartable graphs. 1-12 - H. L. Abbott, Meir Katchalski:
On the snake in the box problem. 13-24 - Paul D. Seymour
:
On the connectivity function of a matroid. 25-30 - Nathan Linial, Roy Meshulam, Michael Tarsi:
Matroidal bijections between graphs. 31-44 - Wolfgang Mader:
Über (k + 1)-kritisch (2k + 1)-fach zusammenhängende Graphen. 45-57 - André Bouchet:
Graphic presentations of isotropic systems. 58-76 - Wenceslas Fernandez de la Vega:
Trees in sparse random graphs. 77-85 - Paul Erdös, Ralph J. Faudree, János Pach, Joel H. Spencer:
How to make a graph bipartite. 86-98 - Edward F. Schmeichel, S. Louis Hakimi:
A cycle structure theorem for hamiltonian graphs. 99-107 - Shen Minggang:
On monochromatic paths in m-coloured tournaments. 108-111 - Alon Nilli:
The average size of an independent set in graphs with a given chromatic number. 112-114 - Harry Lakser, N. S. Mendelsohn, John W. Moon:
Amalgamation of team tournaments. 115-119 - Charles Laywine, J. P. Mayberry:
A simple construction giving the two non-isomorphic triangle-free 3-colored K16's. 120-124
Volume 45, Number 2, October 1988
- Robert E. L. Aldred, Chris D. Godsil:
Distance-regular antipodai covering graphs. 127-134 - Alan M. Frieze, Bill Jackson, Colin J. H. McDiarmid, Bruce A. Reed:
Edge-colouring random graphs. 135-149 - Stephan Olariu:
All variations on perfectly orderable graphs. 150-159 - Wolfgang Schmidt:
A characterization of undirected branching greedoids. 160-184 - Gérard Cornuéjols:
General factors of graphs. 185-198 - Paul A. Catlin:
Graph homomorphisms into the five-cycle. 199-211 - Neil Robertson, Paul D. Seymour:
Graph minors. VII. Disjoint paths on a surface. 212-254 - Stephan Olariu:
No antitwins in minimal imperfect graphs. 255-257
Volume 45, Number 3, December 1988
- Klaus Truemper:
A decomposition theory for matroids IV. Decomposition of graphs. 259-292 - J. Richard Büchi, William E. Fenton:
Large convex sets in oriented matroids. 293-304 - Derek A. Holton, Brendan D. McKay:
The smallest non-hamiltonian 3-connected cubic planar graphs have 38 vertices. 305-319 - Robert C. Dalang, Leslie E. Trotter Jr., Dominique de Werra:
On randomized stopping points and perfect graphs. 320-344 - Haruko Okamura:
Paths in k-edge-connected graphs. 345-355 - Norbert Seifter:
Nilpotent groups and transitive graphs. 356-366 - Michel Las Vergnas:
On the evaluation at (3, 3) of the Tutte polynomial of a graph. 367-372 - Tian Feng:
A short proof of a theorem about the circumference of a graph. 373-375
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:
