Graph amalgamation
In graph theory, a graph amalgamation is a relationship between two graphs (one graph is an amalgamation of another). Similar relationships include subgraphs and minors. Amalgamations can provide a way to reduce a graph to a simpler graph while keeping certain structure intact. The amalgamation can then be used to study properties of the original graph in an easier to understand context. Applications include embeddings, computing genus distribution, and Hamiltonian decompositions.
Link from a Wikipage to another Wikipage
primaryTopic
Graph amalgamation
In graph theory, a graph amalgamation is a relationship between two graphs (one graph is an amalgamation of another). Similar relationships include subgraphs and minors. Amalgamations can provide a way to reduce a graph to a simpler graph while keeping certain structure intact. The amalgamation can then be used to study properties of the original graph in an easier to understand context. Applications include embeddings, computing genus distribution, and Hamiltonian decompositions.
has abstract
In graph theory, a graph amalg ...... nd Hamiltonian decompositions.
@en
Link from a Wikipage to an external page
Wikipage page ID
42,677,761
page length (characters) of wiki page
Wikipage revision ID
819,877,418
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
subject
hypernym
type
comment
In graph theory, a graph amalg ...... nd Hamiltonian decompositions.
@en
label
Graph amalgamation
@en