Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q5121504> ?p ?o }
Showing triples 1 to 91 of
91
with 100 triples per page.
- Q5121504 subject Q7007191.
- Q5121504 subject Q7139601.
- Q5121504 subject Q7494515.
- Q5121504 subject Q8988616.
- Q5121504 abstract "The circle packing theorem (also known as the Koebe–Andreev–Thurston theorem) describes the possible tangency relations between circles in the plane whose interiors are disjoint. A circle packing is a connected collection of circles (in general, on any Riemann surface) whose interiors are disjoint. The intersection graph of a circle packing is the graph having a vertex for each circle, and an edge for every pair of circles that are tangent. If the circle packing is on the plane, or, equivalently, on the sphere, then its intersection graph is called a coin graph; more generally, intersection graphs of interior-disjoint geometric objects are called tangency graphs or contact graphs. Coin graphs are always connected, simple, and planar. The circle packing theorem states that these are the only requirements for a graph to be a coin graph:Circle packing theorem: Forevery connected simple planar graph G there is a circle packing in the planewhose intersection graph is (isomorphic to) G.".
- Q5121504 thumbnail Circle_packing_theorem_K5_minus_edge_example.svg?width=300.
- Q5121504 wikiPageExternalLink 1214441375.
- Q5121504 wikiPageExternalLink viewarticle.php?id=1605&layout=abstract.
- Q5121504 wikiPageExternalLink viewarticle.php?id=1298&layout=abstract.
- Q5121504 wikiPageExternalLink gt3m.
- Q5121504 wikiPageExternalLink ACS_revised.pdf.
- Q5121504 wikiPageExternalLink bibliography.
- Q5121504 wikiPageExternalLink CirclePack.
- Q5121504 wikiPageWikiLink Q110176.
- Q5121504 wikiPageWikiLink Q11352.
- Q5121504 wikiPageWikiLink Q1144897.
- Q5121504 wikiPageWikiLink Q1192869.
- Q5121504 wikiPageWikiLink Q1304193.
- Q5121504 wikiPageWikiLink Q141488.
- Q5121504 wikiPageWikiLink Q1474108.
- Q5121504 wikiPageWikiLink Q1477369.
- Q5121504 wikiPageWikiLink Q15192296.
- Q5121504 wikiPageWikiLink Q166154.
- Q5121504 wikiPageWikiLink Q170058.
- Q5121504 wikiPageWikiLink Q172937.
- Q5121504 wikiPageWikiLink Q186386.
- Q5121504 wikiPageWikiLink Q1878538.
- Q5121504 wikiPageWikiLink Q190524.
- Q5121504 wikiPageWikiLink Q1914255.
- Q5121504 wikiPageWikiLink Q202906.
- Q5121504 wikiPageWikiLink Q203920.
- Q5121504 wikiPageWikiLink Q213363.
- Q5121504 wikiPageWikiLink Q214856.
- Q5121504 wikiPageWikiLink Q214881.
- Q5121504 wikiPageWikiLink Q217608.
- Q5121504 wikiPageWikiLink Q2294516.
- Q5121504 wikiPageWikiLink Q230655.
- Q5121504 wikiPageWikiLink Q2311872.
- Q5121504 wikiPageWikiLink Q238231.
- Q5121504 wikiPageWikiLink Q2534886.
- Q5121504 wikiPageWikiLink Q2619102.
- Q5121504 wikiPageWikiLink Q26401.
- Q5121504 wikiPageWikiLink Q2914964.
- Q5121504 wikiPageWikiLink Q303100.
- Q5121504 wikiPageWikiLink Q319913.
- Q5121504 wikiPageWikiLink Q333927.
- Q5121504 wikiPageWikiLink Q34740.
- Q5121504 wikiPageWikiLink Q3498041.
- Q5121504 wikiPageWikiLink Q37555.
- Q5121504 wikiPageWikiLink Q381892.
- Q5121504 wikiPageWikiLink Q3851477.
- Q5121504 wikiPageWikiLink Q3984063.
- Q5121504 wikiPageWikiLink Q4129097.
- Q5121504 wikiPageWikiLink Q42299.
- Q5121504 wikiPageWikiLink Q441148.
- Q5121504 wikiPageWikiLink Q4418033.
- Q5121504 wikiPageWikiLink Q4455031.
- Q5121504 wikiPageWikiLink Q4555371.
- Q5121504 wikiPageWikiLink Q4780395.
- Q5121504 wikiPageWikiLink Q5000911.
- Q5121504 wikiPageWikiLink Q5121498.
- Q5121504 wikiPageWikiLink Q547823.
- Q5121504 wikiPageWikiLink Q573901.
- Q5121504 wikiPageWikiLink Q595742.
- Q5121504 wikiPageWikiLink Q6060481.
- Q5121504 wikiPageWikiLink Q632814.
- Q5121504 wikiPageWikiLink Q7007191.
- Q5121504 wikiPageWikiLink Q7139601.
- Q5121504 wikiPageWikiLink Q7169664.
- Q5121504 wikiPageWikiLink Q7200963.
- Q5121504 wikiPageWikiLink Q72117.
- Q5121504 wikiPageWikiLink Q726376.
- Q5121504 wikiPageWikiLink Q7307244.
- Q5121504 wikiPageWikiLink Q734209.
- Q5121504 wikiPageWikiLink Q7390256.
- Q5121504 wikiPageWikiLink Q739462.
- Q5121504 wikiPageWikiLink Q740207.
- Q5121504 wikiPageWikiLink Q740898.
- Q5121504 wikiPageWikiLink Q7494515.
- Q5121504 wikiPageWikiLink Q7541353.
- Q5121504 wikiPageWikiLink Q7682871.
- Q5121504 wikiPageWikiLink Q769569.
- Q5121504 wikiPageWikiLink Q850275.
- Q5121504 wikiPageWikiLink Q8988616.
- Q5121504 wikiPageWikiLink Q900117.
- Q5121504 wikiPageWikiLink Q912058.
- Q5121504 wikiPageWikiLink Q927051.
- Q5121504 wikiPageWikiLink Q994399.
- Q5121504 comment "The circle packing theorem (also known as the Koebe–Andreev–Thurston theorem) describes the possible tangency relations between circles in the plane whose interiors are disjoint. A circle packing is a connected collection of circles (in general, on any Riemann surface) whose interiors are disjoint. The intersection graph of a circle packing is the graph having a vertex for each circle, and an edge for every pair of circles that are tangent.".
- Q5121504 label "Circle packing theorem".
- Q5121504 depiction Circle_packing_theorem_K5_minus_edge_example.svg.