Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Theory, Series B, Volume 27
Volume 27, Number 1, August 1979
- Sami Beraha, Joseph Kahane:
Is the four-color conjecture almost false? 1-12 - Siddani Bhaskara Rao:
Solution of the Hamiltonian problem for self-complementary graphs. 13-41 - Paul A. Catlin:
Brooks' graph-coloring theorem and the independence number. 42-48 - Claude A. Christen, Stanley M. Selkow:
Some perfect coloring properties of graphs. 49-59 - Terry A. McKee:
A self-dual language for graph theory. 60-66 - Edward Howorka:
On metric properties of certain clique graphs. 67-74 - Edward J. Farrell:
An introduction to matching polynomials. 75-86 - Daniel I. A. Cohen:
On the combinatorial antipodal-point lemmas. 87-91 - Saul Stahl:
Self-dual embeddings of Cayley graphs. 92-107
Volume 27, Number 2, October 1979
- Edgar M. Palmer, Allen J. Schwenk:
On the number of trees in a random forest. 109-121 - M. J. Rigby, Roger B. Mallion:
On the eigenvalues and eigenvectors of certain finite, vertex-weighted, bipartite graphs. 122-129 - Kenneth Appel, Wolfgang Haken, Jean Mayer:
Triangulation a v5 séparés dans le problème des quatre couleurs. 130-150 - Jack E. Graver:
The imbedding index of a graph. 151-159 - C. C. Chen, H. H. Teh:
Constructions of point-colour-symmetric graphs. 160-167 - Robert E. Woodrow:
There are four countable ultrahomogeneous graphs without triangles. 168-179 - László Babai
:
Spectra of Cayley graphs. 180-189 - Eva Nosal:
Partition relations for denumerable ordinals. 190-197 - Edward F. Schmeichel, Gary S. Bloom:
Connectivity, genus, and the number of components in vertex-deleted subgraphs. 198-201 - Thomas Andreae:
Über eine eigenschaft lokalfiniter, unendlicher bäume. 202-215 - Hien Q. Nguyen:
Constructing the free erection of a geometry. 216-224 - Jaroslav Nesetril, Vojtech Rödl:
A short proof of the existence of highly chromatic hypergraphs without short cycles. 225-227 - F. Stersoul:
A characterization of the graphs in which the transversal number equals the matching number. 228-229
Volume 27, Number 3, December 1979
- Maurice Pouzet:
Note sur le problème de Ulam. 231-236 - Guy Giraud:
Sur le problème de Goodman pour les quadrangles et la majoration des nombres de Ramsey. 237-253 - Andrew G. Thomason:
Critically partitionable graphs, I. 254-259 - Laurence R. Matthews:
Infinite subgraphs as matroid circuits. 260-273 - Eiichi Bannai, Tatsuro Ito:
On the spectra of certain distance-regular graphs. 274-293 - Stephen B. Maurer:
Vertex colorings without isolates. 294-319 - Frank Bernhart, Paul C. Kainen:
The book thickness of a graph. 320-331 - Henry H. Glover, John Philip Huneke, Chin San Wang:
103 Graphs that are irreducible for the projective plane. 332-370
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:
