Abstract
The present chapter will deal with multigraphs, principally graphs, and with directed graphs. What will be done here is, in a sense, “dirty” graph theory, since it will lack the elegance that comes from showing that graphs inherit properties from more general and more abstract combinatorial models. The motivation will come rather from pictorial representations of multigraphs or directed graphs, and we shall rarely escape from this vein in the course of the proofs.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1977 Springer-Verlag, New York Inc.
About this chapter
Cite this chapter
Graver, J.E., Watkins, M.E. (1977). Separation and Connectivity in Multigraphs. In: Combinatorics with Emphasis on the Theory of Graphs. Graduate Texts in Mathematics, vol 54. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-9914-1_6
Download citation
DOI: https://doi.org/10.1007/978-1-4612-9914-1_6
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-9916-5
Online ISBN: 978-1-4612-9914-1
eBook Packages: Springer Book Archive