default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Theory, Series B, Volume 34
Volume 34, Number 1, February 1983
- Andrew Vince
:
Combinatorial maps. 1-21 - Jerrold R. Griggs:
Lower bounds on the independence number in terms of the degrees. 22-39 - Joseph P. S. Kung:
A factorization theorem for comaps of geometric lattices. 40-47 - François Bry:
On the number of 1-factors of locally finite graphs. 48-57 - József Beck:
There is no fast method for finding monochromatic complete subgraphs. 58-64 - David P. Sumner, Pattie Blitch:
Domination critical graphs. 65-76 - Jerrold W. Grossman, Roland Häggkvist:
Alternating cycles in edge-partitioned graphs. 77-81 - Thomas W. Tucker:
Finite groups acting on surfaces and the genus of a group. 82-98 - F. Sterboul:
New results on finite polarized partition relations. 99-103 - Alexander Schrijver:
Short proofs on the matching polyhedron. 104-108 - J. Adrian Bondy:
Large dense neighbourhoods and turán's theorem. 109-111
Volume 34, Number 2, April 1983
- Branko Grünbaum, Geoffrey C. Shephard:
The 2-homeotoxal tilings of the plane and the 2-sphere. 113-150 - Paul M. Terwilliger:
Distance-regular graphs and (s, c, a, k)-graphs. 151-164 - Peter M. Winkler:
Existence of graphs with a given set of r-neighborhoods. 165-176 - Béla Bollobás, Richard K. Guy:
Equitable and proportional coloring of trees. 177-186 - Zoltán Füredi:
Graphs without quadrilaterals. 187-190 - R. Kemp:
The average height of planted plane trees with M leaves. 191-208 - Raul Cordovil:
Sur la compatibilité des extensions ponctuelles d'un matroïde. 209-223 - Cun-Quan Zhang, Weixuan Li:
A class of hypergraphs satisfying an inequality of Lovász. 224-228 - Mordechai Lewin:
On intersection multigraphs of hypergraphs. 229-232 - Takao Asano:
Properties of matroids characterizable in terms of excluded matroids. 233-236
Volume 34, Number 3, June 1983
- C. Chvatál, Vojtech Rödl, Endre Szemerédi, William T. Trotter:
The Ramsey number of a graph with bounded maximum degree. 239-243 - Carsten Thomassen:
Deformations of plane graphs. 244-257 - Alan Tucker:
Coloring graphs with stable cutsets. 258-267 - Edward A. Bender, E. Rodney Canfield:
Enumeration of connected invariant graphs. 268-278 - André Bouchet:
Nowhere-zero integral flows on a bidirected graph. 279-292 - Brian Alspach:
The classification of hamiltonian generalized Petersen graphs. 293-312 - J. F. Rigby:
Some geometrical aspects of a maximal three-coloured triangle-free graph. 313-322 - David G. Kirkpatrick, Maria M. Klawe, Derek G. Corneil:
On pseudosimilarity in trees. 323-339 - Dominique de Caen:
A note on the probabilistic approach to Turán's problem. 340-349 - Mark N. Ellingham, Joseph Douglas Horton:
Non-hamiltonian 3-connected cubic bipartite graphs. 350-353
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 2025-10-22 02:14 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:
