Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Theory, Series B, Volume 35
Volume 35, Number 1, August 1983
- Peter J. Cameron
, Cheryl E. Praeger:
On 2-arc transitive graphs of girth 4. 1-11 - Tomaz Pisanski, John Shawe-Taylor, Joze Vrabec:
Edge-colorability of graph bundles. 12-19 - Weixuan Li:
On matroids of the greatestW-connectivity. 20-27 - Saul Stahl:
A combinatorial analog of the Jordan Curve Theorem. 28-38 - Neil Robertson, Paul D. Seymour:
Graph minors. I. Excluding a forest. 39-61 - Richard A. Brualdi, Li Qiao:
Upsets in round robin tournaments. 62-77 - B. Devadas Acharya:
Even edge colorings of a graph. 78-79 - J. Adrian Bondy:
Erratum. 80
Volume 35, Number 2, October 1983
- Jozef Sirán:
Crossing-critical edges and Kuratowski subgraphs of a graph. 83-92 - Gareth A. Jones, J. S. Thornton:
Operations on maps, and outer automorphisms. 93-103 - Alexander Schrijver:
Packing and covering of crossing families of cuts. 104-128 - Carsten Thomassen:
Girth in graphs. 129-141 - Amram Meir, John W. Moon, Jan Mycielski:
Hereditarily finite sets and identity trees. 142-155 - Richard A. Brualdi, Rachel Manber:
Prime interchange graphs of classes of matrices of zeros and ones. 156-170 - James W. Walker:
From graphs to ortholattices and equivariant maps. 171-192 - Douglas Bauer:
Regular Kn-free graphs. 193-200 - Colin D. Walter:
Intersection numbers for coherent configurations and the spectrum of a graph. 201-204
Volume 35, Number 3, December 1983
- Robert E. Jamison:
On the average number of nodes in a subtree of a tree. 207-223 - Edward R. Scheinerman, Douglas B. West:
The interval number of a planar graph: Three intervals suffice. 224-239 - Chris D. Godsil, William L. Kocay:
Graphs with three mutually pseudo-similar vertices. 240-246 - Zhu Yong-jin, Tian Feng:
A generalization of the Bondy-Chvátal theorem on the k-closure. 247-255 - Andrew Vince:
Regular combinatorial maps. 256-277 - P. A. Deift, Carlos Tomei:
On the determinant of the adjacency matrix for a planar sublattice. 278-289 - Béla Bollobás, Pierre Duchet:
On Helly families of maximal size. 290-296 - Jean-Claude Bermond, Bill Jackson, François Jaeger:
Shortest coverings of graphs with cycles. 297-308 - Peter C. Fishburn:
On the sphericity and cubicity of graphs. 309-318 - Peter J. Slater:
On k-graceful, locally finite graphs. 319-322 - Vasek Chvátal, Endre Szemerédi:
Short cycles in directed graphs. 323-327 - Wenceslas Fernandez de la Vega:
On the maximum cardinality of a consistent set of arcs in a random tournament. 328-332 - A. Augusteijn, A. J. W. Duijvestijn:
Simple perfect square-cylinders of low order. 333-337
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-18 20:20 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:
