Graphs

G. Pólya and R. C. Read
Additional contact information
R. C. Read: University of Waterloo, Department of Combinatorics and Optimization

Chapter Chapter 2 in Combinatorial Enumeration of Groups, Graphs, and Chemical Compounds, 1987, pp 32-57 from Springer

Abstract: Abstract In the next sections we describe in axiomatic-combinatorial terms what the chemists call structure and stereoformulas. To enhance the clarity of the exposition I provide more than the bare essentials. I begin by repeating some known definitions in graph theory. Some problems touched upon in the Introduction are going to be presented “officially” later on. I will adhere as much as possible to the terminology used by D. König in his elegant text.1 I will highlight where substantial departure seemed to better serve the special purpose of this paper.

Keywords: Functional Equation; Centric Tree; Permutation Group; Arbitrary Graph; Exceptional Point (search for similar items in EconPapers)
Date: 1987
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4612-4664-0_3

Ordering information: This item can be ordered from
http://www.springer.com/9781461246640

DOI: 10.1007/978-1-4612-4664-0_3

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().