Name: The Coloring of Graphs
Creator: Whitney, Hassler
Keywords: topology, coloring of graphs, Exact enumeration problems, generating functions

The coloring of graphs

descriptionPublicationkeyboard_double_arrow_right Article , Part of book or chapter of book 01 Feb 1931 English Publisher:Proceedings of the National Academy of SciencesJournal:Proceedings of the National Academy of Sciences, volume 17, pages 122-125 (issn: 0027-8424, eissn: 1091-6490,

Authors: Whitney, Hassler;

doi: 10.1073/pnas.17.2.122 , 10.2307/1968214 , 10.1007/978-1-4612-2972-8_5

pmid: 16587623

pmc: PMC1076007

The Coloring of Graphs

- Summary
- Subjects
- Metrics

Abstract

In another paper, L,3 the author has given a proof of a formula for M(λ), the number of ways of coloring a graph in λ colors, due to Birkhoff. The numbers m ij , in terms of which M(λ) is expressed, are here studied in detail; a method of calculating them is given.

Related Organizations

Harvard University
United States

Keywords

topology, coloring of graphs, Exact enumeration problems, generating functions

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	142
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 1%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 0.1%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average

Found an issue? Give us feedback

142

Top 1%

Top 0.1%

Average

bronze