Core (graph theory)

This article is about graph homomorphisms. For the subgraph in which all vertices have high degree, see k-core. For the union of all maximum matchings, see Dulmage–Mendelsohn decomposition.

In the mathematical field of graph theory, a core is a notion that describes behavior of a graph with respect to graph homomorphisms.

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.