Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Dirac, G. A.
1952.
Map-Colour Theorems.
Canadian Journal of Mathematics,
Vol. 4,
Issue. ,
p.
480.
Rosenfeld, M.
1964.
Independent sets in regular graphs.
Israel Journal of Mathematics,
Vol. 2,
Issue. 4,
p.
262.
Goodrich, E. D.
Williams, K. S.
Blake, Jean A.
Johnson, E. L.
Rosen, Michael
Duncan, R. L.
Jacobson, R. A.
and
Painter, Page
1966.
Mathematical Notes.
The American Mathematical Monthly,
Vol. 73,
Issue. 1,
p.
40.
1967.
Vol. 27,
Issue. ,
p.
249.
Lovász, L.
1968.
On chromatic number of finite set-systems.
Acta Mathematica Academiae Scientiarum Hungaricae,
Vol. 19,
Issue. 1-2,
p.
59.
Melnikov, L.S.
and
Vizing, V.G.
1969.
New proof of brooks' theorem.
Journal of Combinatorial Theory,
Vol. 7,
Issue. 4,
p.
289.
Ponstein, J.
1969.
A new proof of Brooks's chromatic number theorem for graphs.
Journal of Combinatorial Theory,
Vol. 7,
Issue. 3,
p.
255.
Finck, H.‐J.
and
Sachs, H.
1969.
Über eine von H. S. WILF angegebene Schranke für die chromatische Zahl endlicher Graphen.
Mathematische Nachrichten,
Vol. 39,
Issue. 4-6,
p.
373.
Holgate, P.
1969.
Majorants of the Chromatic Number of a Random Graph.
Journal of the Royal Statistical Society Series B: Statistical Methodology,
Vol. 31,
Issue. 2,
p.
303.
Turner, James
and
Kautz, William H.
1970.
A Survey of Progress in Graph Theory in the Soviet Union.
SIAM Review,
Vol. 12,
Issue. S1,
p.
1.
Grünbaum, Branko
1970.
Higher-Dimensional analogs of the four-color problem and some inequalities for simplicial complexes.
Journal of Combinatorial Theory,
Vol. 8,
Issue. 2,
p.
147.
Rosenfeld, M.
1971.
On the total coloring of certain graphs.
Israel Journal of Mathematics,
Vol. 9,
Issue. 3,
p.
396.
Matula, David W.
Marble, George
and
Isaacson, Joel D.
1972.
Graph Theory and Computing.
p.
109.
Saaty, Thomas L.
1972.
Thirteen Colorful Variations on Guthrie's Four-Color Conjecture.
The American Mathematical Monthly,
Vol. 79,
Issue. 1,
p.
2.
Matula, David W.
1972.
k-Components, Clusters and Slicings in Graphs.
SIAM Journal on Applied Mathematics,
Vol. 22,
Issue. 3,
p.
459.
1973.
Graphs and Hypergraphs.
Vol. 6,
Issue. ,
p.
498.
Chvátal, V.
1973.
Tough graphs and hamiltonian circuits.
Discrete Mathematics,
Vol. 5,
Issue. 3,
p.
215.
Meyer, Walter
1973.
Equitable Coloring.
The American Mathematical Monthly,
Vol. 80,
Issue. 8,
p.
920.
Amin, A.
and
Hakimi, S.
1973.
Graphs with given connectivity and independence number or networks with given measures of vulnerability and survivability.
IEEE Transactions on Circuit Theory,
Vol. 20,
Issue. 1,
p.
2.
Kainen, Paul C.
1974.
Graphs and Combinatorics.
Vol. 406,
Issue. ,
p.
76.