| http://dbpedia.org/ontology/abstract
|
In combinatorial mathematics, an Apollonia … In combinatorial mathematics, an Apollonian network is an undirected graph formed by a process of recursively subdividing a triangle into three smaller triangles. Apollonian networks may equivalently be defined as the planar 3-trees, the maximal planar chordal graphs, the uniquely 4-colorable planar graphs, and the graphs of stacked polytopes. They are named after Apollonius of Perga, who studied a related circle-packing construction.ied a related circle-packing construction.
, Граф Аполлония — неориентированный граф, о … Граф Аполлония — неориентированный граф, образованный рекурсивным процессом подразделения треугольника на три меньших треугольника. Графы Аполлония можно эквивалентно определить как планарные 3-деревья, как максимальные планарные хордальные графы, как однозначно 4-раскрашиваемые планарные графы или как графы блоковых многогранников. Графы названы именем Аполлония Пергского, изучавшего связанные построения упаковки кругов.шего связанные построения упаковки кругов.
|
| http://dbpedia.org/ontology/thumbnail
|
http://commons.wikimedia.org/wiki/Special:FilePath/Apollonian-network.svg?width=300 +
|
| http://dbpedia.org/ontology/wikiPageExternalLink
|
http://siam.org/proceedings/soda/2011/SODA11_088_demainee.pdf +
, http://cccg.ca/proceedings/2010/paper51.pdf +
, http://www.math.washington.edu/~ejpecp/viewarticle.php%3Fid=1863&layout=abstract +
, http://www2.uah.es/gtc06/abstracts/AbstractsPosterSession.pdf +
, http://www.cs.nmsu.edu/fnh/publ.html +
, http://www.emis.de/journals/EJC/Volume_15/PDF/v15i1r77.pdf +
, http://www.math.cmu.edu/~ctsourak/ran.html +
, http://projecteuclid.org/euclid.pjm/1103035751 +
, http://www.msri.org/publications/books/gt3m/ +
, https://web.archive.org/web/20110601075117/http:/siam.org/proceedings/soda/2011/SODA11_088_demainee.pdf +
, http://cccg.ca/proceedings/2007/09b4full.pdf +
, http://people.math.gatech.edu/~thomas/FC/fowlerphd.pdf +
, http://www.math.ucsd.edu/~ronspubs/10_12_iterated_triangles.pdf +
|
| http://dbpedia.org/ontology/wikiPageID
|
31104610
|
| http://dbpedia.org/ontology/wikiPageLength
|
41557
|
| http://dbpedia.org/ontology/wikiPageRevisionID
|
1094649097
|
| http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/Bridge_%28graph_theory%29 +
, http://dbpedia.org/resource/Schnyder_wood +
, http://dbpedia.org/resource/Extremal_graph_theory +
, http://dbpedia.org/resource/Hamiltonian_cycle +
, http://dbpedia.org/resource/Category:Planar_graphs +
, http://dbpedia.org/resource/Clique-sum +
, http://dbpedia.org/resource/Apollonius_of_Perga +
, http://dbpedia.org/resource/Graph_toughness +
, http://dbpedia.org/resource/Graphs_and_Combinatorics +
, http://dbpedia.org/resource/Clique_%28graph_theory%29 +
, http://dbpedia.org/resource/Degeneracy_%28graph_theory%29 +
, http://dbpedia.org/resource/Forbidden_graph_characterization +
, http://dbpedia.org/resource/Complete_bipartite_graph +
, http://dbpedia.org/resource/Category:Perfect_graphs +
, http://dbpedia.org/resource/Four_color_theorem +
, http://dbpedia.org/resource/Centroid +
, http://dbpedia.org/resource/Graph_minor +
, http://dbpedia.org/resource/Chordal_graph +
, http://dbpedia.org/resource/MathSciNet +
, http://dbpedia.org/resource/Complete_graph +
, http://dbpedia.org/resource/Octahedron +
, http://dbpedia.org/resource/Uniquely_colorable_graph +
, http://dbpedia.org/resource/Undirected_graph +
, http://dbpedia.org/resource/Computer_vision +
, http://dbpedia.org/resource/Degree_%28graph_theory%29 +
, http://dbpedia.org/resource/Graph_isomorphism +
, http://dbpedia.org/resource/Segmentation_%28image_processing%29 +
, http://dbpedia.org/resource/Loop_subdivision_surface +
, http://dbpedia.org/resource/Planar_graph +
, http://dbpedia.org/resource/Small_world_effect +
, http://dbpedia.org/resource/Power_law +
, http://dbpedia.org/resource/Ternary_tree +
, http://dbpedia.org/resource/Indagationes_Mathematicae +
, http://dbpedia.org/resource/File:Apollonian_gasket.svg +
, http://dbpedia.org/resource/Perfect_matching +
, http://dbpedia.org/resource/Euclidean_plane +
, http://dbpedia.org/resource/Israel_Journal_of_Mathematics +
, http://dbpedia.org/resource/Graph_embedding +
, http://dbpedia.org/resource/W._T._Tutte +
, http://dbpedia.org/resource/Category:Graph_families +
, http://dbpedia.org/resource/L%C3%A1szl%C3%B3_Lov%C3%A1sz +
, http://dbpedia.org/resource/Sierpinski_triangle +
, http://dbpedia.org/resource/Graph_theory +
, http://dbpedia.org/resource/Bisection +
, http://dbpedia.org/resource/Generating_function +
, http://dbpedia.org/resource/Polynomial_time +
, http://dbpedia.org/resource/Discrete_Mathematics_%28journal%29 +
, http://dbpedia.org/resource/Y-%CE%94_transform +
, http://dbpedia.org/resource/Graph_coloring +
, http://dbpedia.org/resource/Apollonian_gasket +
, http://dbpedia.org/resource/Pentagonal_prism +
, http://dbpedia.org/resource/Barycentric_coordinate_system_%28mathematics%29 +
, http://dbpedia.org/resource/Combinatorics +
, http://dbpedia.org/resource/Robertson%E2%80%93Seymour_theorem +
, http://dbpedia.org/resource/Category:Triangulation_%28geometry%29 +
, http://dbpedia.org/resource/File:Goldner-Harary_graph.svg +
, http://dbpedia.org/resource/Incenter +
, http://dbpedia.org/resource/Steinitz%27s_theorem +
, http://dbpedia.org/resource/Independent_set_%28graph_theory%29 +
, http://dbpedia.org/resource/Rational_number +
, http://dbpedia.org/resource/Circle_packing_theorem +
, http://dbpedia.org/resource/Simplicial_polytope +
, http://dbpedia.org/resource/Kleetope +
, http://dbpedia.org/resource/Bounding_box +
, http://dbpedia.org/resource/Biconnected_component +
, http://dbpedia.org/resource/Maximal_element +
, http://dbpedia.org/resource/Problem_of_Apollonius +
, http://dbpedia.org/resource/K-tree +
, http://dbpedia.org/resource/Goldner%E2%80%93Harary_graph +
, http://dbpedia.org/resource/Acta_Mathematica +
, http://dbpedia.org/resource/Polyhedral_graph +
, http://dbpedia.org/resource/Cubic_graph +
, http://dbpedia.org/resource/Equilateral_triangle +
, http://dbpedia.org/resource/Stacked_polytope +
, http://dbpedia.org/resource/File:Triakistetrahedron.jpg +
, http://dbpedia.org/resource/Partial_k-tree +
, http://dbpedia.org/resource/Polyhedral_combinatorics +
, http://dbpedia.org/resource/Polyhedron +
, http://dbpedia.org/resource/Combinatorial_enumeration +
, http://dbpedia.org/resource/File:Apollonian-network.svg +
, http://dbpedia.org/resource/Alan_M._Frieze +
, http://dbpedia.org/resource/Connectivity_%28graph_theory%29 +
, http://dbpedia.org/resource/Michael_D._Plummer +
, http://dbpedia.org/resource/Journal_of_Combinatorial_Theory +
, http://dbpedia.org/resource/Barycentric_subdivision +
, http://dbpedia.org/resource/Maximal_clique +
, http://dbpedia.org/resource/Planar_dual +
, http://dbpedia.org/resource/Vertex_connectivity +
, http://dbpedia.org/resource/File:Circle_packing_theorem_K5_minus_edge_example.svg +
|
| http://dbpedia.org/property/title
|
Apollonian Network
|
| http://dbpedia.org/property/urlname
|
ApollonianNetwork
|
| http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:Sfnp +
, http://dbpedia.org/resource/Template:Harvtxt +
, http://dbpedia.org/resource/Template:OEIS +
, http://dbpedia.org/resource/Template:Refend +
, http://dbpedia.org/resource/Template:Refbegin +
, http://dbpedia.org/resource/Template:Reflist +
, http://dbpedia.org/resource/Template:Citation +
, http://dbpedia.org/resource/Template:Mathworld +
, http://dbpedia.org/resource/Template:Math +
, http://dbpedia.org/resource/Template:Mvar +
, http://dbpedia.org/resource/Template:Short_description +
|
| http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Triangulation_%28geometry%29 +
, http://dbpedia.org/resource/Category:Planar_graphs +
, http://dbpedia.org/resource/Category:Graph_families +
, http://dbpedia.org/resource/Category:Perfect_graphs +
|
| http://purl.org/linguistics/gold/hypernym
|
http://dbpedia.org/resource/Graph +
|
| http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/Apollonian_network?oldid=1094649097&ns=0 +
|
| http://xmlns.com/foaf/0.1/depiction
|
http://commons.wikimedia.org/wiki/Special:FilePath/Goldner-Harary_graph.svg +
, http://commons.wikimedia.org/wiki/Special:FilePath/Circle_packing_theorem_K5_minus_edge_example.svg +
, http://commons.wikimedia.org/wiki/Special:FilePath/Triakistetrahedron.jpg +
, http://commons.wikimedia.org/wiki/Special:FilePath/Apollonian-network.svg +
, http://commons.wikimedia.org/wiki/Special:FilePath/Apollonian_gasket.svg +
|
| http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/Apollonian_network +
|
| owl:sameAs |
http://rdf.freebase.com/ns/m.0gh8yx1 +
, http://www.wikidata.org/entity/Q4780395 +
, https://global.dbpedia.org/id/4RQu2 +
, http://ru.dbpedia.org/resource/%D0%93%D1%80%D0%B0%D1%84_%D0%90%D0%BF%D0%BE%D0%BB%D0%BB%D0%BE%D0%BD%D0%B8%D1%8F +
, http://yago-knowledge.org/resource/Apollonian_network +
, http://uk.dbpedia.org/resource/%D0%93%D1%80%D0%B0%D1%84_%D0%90%D0%BF%D0%BE%D0%BB%D0%BB%D0%BE%D0%BD%D1%96%D1%8F +
, http://dbpedia.org/resource/Apollonian_network +
|
| rdf:type |
http://dbpedia.org/class/yago/WikicatPerfectGraphs +
, http://dbpedia.org/class/yago/Graph107000195 +
, http://dbpedia.org/class/yago/VisualCommunication106873252 +
, http://dbpedia.org/class/yago/Abstraction100002137 +
, http://dbpedia.org/class/yago/WikicatPlanarGraphs +
, http://dbpedia.org/class/yago/Communication100033020 +
, http://dbpedia.org/ontology/Software +
|
| rdfs:comment |
Граф Аполлония — неориентированный граф, о … Граф Аполлония — неориентированный граф, образованный рекурсивным процессом подразделения треугольника на три меньших треугольника. Графы Аполлония можно эквивалентно определить как планарные 3-деревья, как максимальные планарные хордальные графы, как однозначно 4-раскрашиваемые планарные графы или как графы блоковых многогранников. Графы названы именем Аполлония Пергского, изучавшего связанные построения упаковки кругов.шего связанные построения упаковки кругов.
, In combinatorial mathematics, an Apollonia … In combinatorial mathematics, an Apollonian network is an undirected graph formed by a process of recursively subdividing a triangle into three smaller triangles. Apollonian networks may equivalently be defined as the planar 3-trees, the maximal planar chordal graphs, the uniquely 4-colorable planar graphs, and the graphs of stacked polytopes. They are named after Apollonius of Perga, who studied a related circle-packing construction.ied a related circle-packing construction.
|
| rdfs:label |
Граф Аполлония
, Граф Аполлонія
, Apollonian network
|
