Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Theory, Series B, Volume 22
Volume 22, Number 1, February 1977
- S. B. Rao:
Cycles in self-complementary graphs. 1-9 - K. C. Stacey, Derek A. Holton:
On the automorphism group of a tree. 10-25 - Anton Kotzig:
Change graphs of edge-colorings of planar cubic graphs. 26-30 - Robert E. Bixby:
Kuratowski's and Wagner's theorems for matroids. 31-53 - William T. Trotter, John I. Moore Jr.:
The dimension of planar posets. 54-67 - Martin Charles Golumbic:
Comparability graphs and a new matroid. 68-90
Volume 22, Number 2, April 1977
- Jon Henry Sanders, David Sanders:
Circuit preserving edge maps. 91-96 - Claude Berge, F. Sterboul:
Equipartite colorings in graphs and hypergraphs. 97-113 - Robert Donaghey:
Restricted plane tree representations of four Motzkin-Catalan equations. 114-121 - P. J. Wilde:
Matroids with given restrictions and contractions. 122-130 - H. S. M. Coxeter, Geoffrey C. Shephard:
Regular 3-complexes with toroidal cells. 131-138 - J. D. Donald, Carlos A. Holzmann, M. D. Tobey:
A characterization of complete matroid base graphs. 139-158 - F. Sterboul:
An extremal problem in hypergraph coloring. 159-164 - Ho-Jin Lee:
A note on geodetic graphs of diameter two and their relation to orthogonal Latin squares. 165-167 - Richard C. O'Brien:
An upper bound on the path number of a digraph. 168-174 - Richard A. Brualdi, Peter M. Gibson:
Convex polyhedra of doubly stochastic matrices: II. Graph of Omegan. 175-198
Volume 22, Number 3, June 1977
- Alan P. Sprague:
Regular graphs with high edge degree. 199-206 - Kenneth Lebensold:
Disjoint matchings of graphs. 207-210 - Guy Giraud:
Sur les R-coloriages minimaux. 211-226 - Jonathan L. Gross:
Every connected regular graph of even degree is a Schreier coset graph. 227-232 - Sukhamay Kundu:
The Chartrand-Schuster conjecture: Graphs with unique distance trees are regular. 233-245 - Robert A. Liebler:
On the uniqueness of the tetrahedral association schemes. 246-262 - Linda M. Lesniak-Foster:
On n-Hamiltonian line graphs. 263-273 - Douglas R. Woodall:
Circuits containing specified edges. 274-278 - Carsten Thomassen:
Note on circuits containing specified edges. 279-280 - Vladimír Müller:
The edge reconstruction hypothesis is true for graphs with more than n · log2n edges. 281-283 - Sándor Horváth:
On the existence of k-separated finite and infinite dipaths. 284-285 - Hans Georg Carstens, Arian Kruse:
Graphs in which each m-tuple of vertices is adjacent to the same number n of other vertices. 286-288 - Paul D. Seymour
:
A note on the production of matroid minors. 289-295 - Herbert S. Wilf:
A note on P(-lambda; G). 296 - Peter J. Cameron:
Automorphisms and cohomology of switching classes. 297-298 - Chang M. Bang, Henry Sharp Jr.:
An elementary proof of Moon's theorem on generalized tournaments. 299-301 - Pak-Ken Wong:
A note on a paper of G. Wegner. 302-303
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-25 05:28 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:
