Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Halin_graph> ?p ?o }
Showing triples 1 to 81 of
81
with 100 triples per page.
- Halin_graph abstract "In graph theory, a Halin graph is a type of planar graph. It is constructed from a tree that has at least four vertices, none of which have exactly two neighbors. The tree is drawn in the plane so none of its edges cross; then edges are added that connect all its leaves into a cycle. Halin graphs are named after German mathematician Rudolf Halin, who studied them in 1971, but the cubic Halin graphs had already been studied over a century earlier by Kirkman.".
- Halin_graph thumbnail Halin_graph.svg?width=300.
- Halin_graph wikiPageExternalLink gc_198.html.
- Halin_graph wikiPageID "19658548".
- Halin_graph wikiPageLength "12529".
- Halin_graph wikiPageOutDegree "52".
- Halin_graph wikiPageRevisionID "683711286".
- Halin_graph wikiPageWikiLink Biconnected_graph.
- Halin_graph wikiPageWikiLink Bipartite_graph.
- Halin_graph wikiPageWikiLink Category:Graph_families.
- Halin_graph wikiPageWikiLink Category:Planar_graphs.
- Halin_graph wikiPageWikiLink Circuit_rank.
- Halin_graph wikiPageWikiLink Connectivity_(graph_theory).
- Halin_graph wikiPageWikiLink Convex_polyhedra.
- Halin_graph wikiPageWikiLink Convex_polyhedron.
- Halin_graph wikiPageWikiLink Convex_polytope.
- Halin_graph wikiPageWikiLink Cubic_graph.
- Halin_graph wikiPageWikiLink Cycle_(graph_theory).
- Halin_graph wikiPageWikiLink Degree_(graph_theory).
- Halin_graph wikiPageWikiLink Dual_graph.
- Halin_graph wikiPageWikiLink Dynamic_programming.
- Halin_graph wikiPageWikiLink Euclidean_plane.
- Halin_graph wikiPageWikiLink Frucht_graph.
- Halin_graph wikiPageWikiLink Graph_automorphism.
- Halin_graph wikiPageWikiLink Graph_connectivity.
- Halin_graph wikiPageWikiLink Graph_embedding.
- Halin_graph wikiPageWikiLink Graph_enumeration.
- Halin_graph wikiPageWikiLink Graph_theory.
- Halin_graph wikiPageWikiLink Hamiltonian_cycle.
- Halin_graph wikiPageWikiLink Hamiltonian_graph.
- Halin_graph wikiPageWikiLink Hamiltonian_path.
- Halin_graph wikiPageWikiLink Hans_Rademacher.
- Halin_graph wikiPageWikiLink Incidence_coloring.
- Halin_graph wikiPageWikiLink Independent_set_(graph_theory).
- Halin_graph wikiPageWikiLink Linear_time.
- Halin_graph wikiPageWikiLink Maximal_element.
- Halin_graph wikiPageWikiLink Maximum_independent_set.
- Halin_graph wikiPageWikiLink Minimal_element.
- Halin_graph wikiPageWikiLink NP-complete.
- Halin_graph wikiPageWikiLink NP-completeness.
- Halin_graph wikiPageWikiLink Outerplanar_graph.
- Halin_graph wikiPageWikiLink Pancyclic_graph.
- Halin_graph wikiPageWikiLink Planar_graph.
- Halin_graph wikiPageWikiLink Planarity_testing.
- Halin_graph wikiPageWikiLink Polyhedral_graph.
- Halin_graph wikiPageWikiLink Pyramid_(geometry).
- Halin_graph wikiPageWikiLink Rudolf_Halin.
- Halin_graph wikiPageWikiLink Star_(graph_theory).
- Halin_graph wikiPageWikiLink Steinitzs_theorem.
- Halin_graph wikiPageWikiLink Thomas_Kirkman.
- Halin_graph wikiPageWikiLink Time_complexity.
- Halin_graph wikiPageWikiLink Tree_(graph_theory).
- Halin_graph wikiPageWikiLink Treewidth.
- Halin_graph wikiPageWikiLink Triangle-free_graph.
- Halin_graph wikiPageWikiLink Triangular_prism.
- Halin_graph wikiPageWikiLink Two-dimensional_space.
- Halin_graph wikiPageWikiLink Wheel_graph.
- Halin_graph wikiPageWikiLink File:Halin_graph.svg.
- Halin_graph wikiPageWikiLink File:Triangular_prism_as_halin_graph.svg.
- Halin_graph wikiPageWikiLink File:Wheel_graphs.svg.
- Halin_graph wikiPageWikiLinkText "Halin graph".
- Halin_graph hasPhotoCollection Halin_graph.
- Halin_graph id "HalinGraph".
- Halin_graph title "Halin Graph".
- Halin_graph wikiPageUsesTemplate Template:Mathworld.
- Halin_graph wikiPageUsesTemplate Template:Reflist.
- Halin_graph subject Category:Graph_families.
- Halin_graph subject Category:Planar_graphs.
- Halin_graph hypernym Graph.
- Halin_graph type Software.
- Halin_graph type Graph.
- Halin_graph comment "In graph theory, a Halin graph is a type of planar graph. It is constructed from a tree that has at least four vertices, none of which have exactly two neighbors. The tree is drawn in the plane so none of its edges cross; then edges are added that connect all its leaves into a cycle. Halin graphs are named after German mathematician Rudolf Halin, who studied them in 1971, but the cubic Halin graphs had already been studied over a century earlier by Kirkman.".
- Halin_graph label "Halin graph".
- Halin_graph sameAs Graphe_de_Halin.
- Halin_graph sameAs m.04n54ng.
- Halin_graph sameAs Граф_Халина.
- Halin_graph sameAs Q2913731.
- Halin_graph sameAs Q2913731.
- Halin_graph wasDerivedFrom Halin_graph?oldid=683711286.
- Halin_graph depiction Halin_graph.svg.
- Halin_graph isPrimaryTopicOf Halin_graph.