Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q18207512> ?p ?o }
Showing triples 1 to 22 of
22
with 100 triples per page.
- Q18207512 subject Q7217283.
- Q18207512 abstract "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.".
- Q18207512 wikiPageExternalLink Bahmanian2012.pdf.
- Q18207512 wikiPageExternalLink getPaper-86.html?id=227.
- Q18207512 wikiPageExternalLink 0095895684900200.
- Q18207512 wikiPageWikiLink Q1050972.
- Q18207512 wikiPageWikiLink Q131476.
- Q18207512 wikiPageWikiLink Q15710060.
- Q18207512 wikiPageWikiLink Q166507.
- Q18207512 wikiPageWikiLink Q180907.
- Q18207512 wikiPageWikiLink Q2137023.
- Q18207512 wikiPageWikiLink Q229102.
- Q18207512 wikiPageWikiLink Q2642629.
- Q18207512 wikiPageWikiLink Q273037.
- Q18207512 wikiPageWikiLink Q3186905.
- Q18207512 wikiPageWikiLink Q45715.
- Q18207512 wikiPageWikiLink Q540672.
- Q18207512 wikiPageWikiLink Q573410.
- Q18207512 wikiPageWikiLink Q7217283.
- Q18207512 wikiPageWikiLink Q905837.
- Q18207512 comment "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.".
- Q18207512 label "Graph amalgamation".