default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Theory, Series B, Volume 49
Volume 49, Number 1, June 1990
- Vasek Chvátal, William J. Lenhart, Najiba Sbihi:
Two-colourings that decompose perfect graphs. 1-9 - András Sebö:
Undirected distances and the postman-structure of graphs. 10-39 - Neil Robertson, Paul D. Seymour
:
Graph minors. IX. Disjoint crossed paths. 40-77 - Geoffrey P. Whittle:
Quotients of dilworth truncations. 78-86 - Carsten Thomassen:
Resistances and currents in infinite electrical networks. 87-102 - Daniel Bienstock:
On embedding graphs in trees. 103-136 - Genghua Fan:
Covering weighted graphs by even subgraphs. 137-141
Volume 49, Number 2, August 1990
- Joseph Zaks:
On the connectedness of some geometric graphs. 143-150 - Genghua Fan:
Long cycles and the codiameter of a graph, I. 151-180 - James G. Oxley:
A characterization of a class of non-binary matroids. 181-189 - Norman L. Biggs, A. G. Boshier:
Note on the girth of Ramanujan graphs. 190-194 - Michel Las Vergnas:
Acyclic reorientations of weakly oriented matroids. 195-199 - Ryan B. Hayward:
Murky graphs. 200-235 - Karanbir S. Sarkaria:
A generalized kneser conjecture. 236-240 - Klaus Truemper:
A decomposition theory for matroids. V. Testing of matrix total unimodularity. 241-281 - Chính T. Hoàng:
On the sibling-structure of perfect graphs. 282-286 - Armen S. Asratian, N. K. Khachatrian:
Some localization theorems on hamiltonian circuits. 287-294 - Ilia Krasikov:
A note on the edge-reconstruction of K1, m-free graphs. 295-298
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-22 19:42 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:
