Graphs, Part II: More Advanced Notions
Part of the Universitext book series (UTX)
In this section, we take a closer look at the structure of cycles in a finite graph G. It turns out that there is a dual notion to that of a cycle, the notion of a cocycle.
KeywordsBipartite Graph Planar Graph Hamiltonian Cycle Incidence Matrix Maximum Match
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- 2.Marcel Berger. Géométrie 1. Nathan, 1990. English edition: Geometry 1, Universitext, New York: Springer Verlag.Google Scholar
- 6.Fan R. K. Chung. Spectral Graph Theory, vol. 92 of Regional Conference Series in Mathematics. Providence, RI: AMS, first edition, 1997.Google Scholar
- 8.Peter Cromwell. Polyhedra. Cambridge, UK: Cambridge University Press, first edition, 1994.Google Scholar
- 9.Reinhard Diestel. Graph Theory. GTM No. 173. New York: Springer Verlag, third edition, 2005.Google Scholar
- 11.Jean H. Gallier. Geometric Methods and Applications, for Computer Science and Engineering. TAM, Vol. 38. New York: Springer, first edition, 2000.Google Scholar
- 12.Chris Godsil and Gordon Royle. Algebraic Graph Theory. GTM No. 207. New York: Springer Verlag, first edition, 2001.Google Scholar
- 15.Frank Harary. Graph Theory. Reading, MA: Addison Wesley, first edition, 1971.Google Scholar
- 16.Jon Kleinberg and Eva Tardos. Algorithm Design. Reading, MA: Addison Wesley, first edition, 2006.Google Scholar
- 17.James R. Munkres. Elements of Algebraic Topology. Reading, MA: Addison-Wesley, first edition, 1984.Google Scholar
- 22.Herbert S. Wilf. Algorithms and Complexity. Wellesley, MA: A K Peters, second edition, 2002.Google Scholar
© Springer Science+Business Media, LLC 2011