Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Grünbaum, Branko
1969.
The Many Facets of Graph Theory.
Vol. 110,
Issue. ,
p.
115.
Lin, Y.-F
and
Ratti, J.S
1970.
The graphs of semirings.
Journal of Algebra,
Vol. 14,
Issue. 1,
p.
73.
1971.
Elements of Combinatorial Computing.
p.
243.
1973.
Graphs and Hypergraphs.
Vol. 6,
Issue. ,
p.
498.
Kozyrev, V. P.
1974.
Graph theory.
Journal of Soviet Mathematics,
Vol. 2,
Issue. 5,
p.
489.
Bollobás, Béla
1976.
On complete subgraphs of different orders.
Mathematical Proceedings of the Cambridge Philosophical Society,
Vol. 79,
Issue. 1,
p.
19.
Dewdney, A. K.
1976.
The intersection numbers of a complex.
Aequationes Mathematicae,
Vol. 14,
Issue. 3,
p.
357.
Orlin, James
1977.
Contentment in graph theory: Covering graphs with cliques.
Indagationes Mathematicae (Proceedings),
Vol. 80,
Issue. 5,
p.
406.
Bollobás, Béla
1977.
Extremal problems in graph theory.
Journal of Graph Theory,
Vol. 1,
Issue. 2,
p.
117.
Roberts, Fred S.
1979.
ON THE MOBILE RADIO FREQUENCY ASSIGNMENT PROBLEM AND THE TRAFFIC LIGHT PHASING PROBLEM.
Annals of the New York Academy of Sciences,
Vol. 319,
Issue. 1,
p.
466.
Győri, E.
and
Kostochka, A. V.
1979.
On a problem of G. O. H. Katona and T. Tarján.
Acta Mathematica Academiae Scientiarum Hungaricae,
Vol. 34,
Issue. 3-4,
p.
321.
Golumbic, Martin Charles
1980.
Algorithmic Graph Theory and Perfect Graphs.
p.
1.
Poljak, Svatopluk
Rödl, Vojtěch
and
Turzík, Daniel
1981.
Complexity of representation of graphs by set systems.
Discrete Applied Mathematics,
Vol. 3,
Issue. 4,
p.
301.
Erdős, P.
1981.
On the combinatorial problems which I would most like to see solved.
Combinatorica,
Vol. 1,
Issue. 1,
p.
25.
Chung, F. R. K.
1981.
On the Decomposition of Graphs.
SIAM Journal on Algebraic Discrete Methods,
Vol. 2,
Issue. 1,
p.
1.
Brigham, Robert C.
and
Dutton, Ronald D.
1981.
Graphs which, with their complements, have certain clique covering numbers.
Discrete Mathematics,
Vol. 34,
Issue. 1,
p.
1.
Pullman, N.J.
Shank, H.
and
Wallis, W.D.
1982.
Clique coverings of graphs V: maximal-clique partitions.
Bulletin of the Australian Mathematical Society,
Vol. 25,
Issue. 3,
p.
337.
Lehel, J.
1982.
Covers in hypergraphs.
Combinatorica,
Vol. 2,
Issue. 3,
p.
305.
Lehel, J.
and
Tuza, Zs.
1982.
Triangle-free partial graphs and edge covering theorems.
Discrete Mathematics,
Vol. 39,
Issue. 1,
p.
59.
Gregory, David A.
and
Pullman, Norman J.
1982.
On a clique covering problem of orlin.
Discrete Mathematics,
Vol. 41,
Issue. 1,
p.
97.