Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Halin's_grid_theorem> ?p ?o. }
Showing items 1 to 20 of
20
with 100 items per page.
- Halin's_grid_theorem abstract "In graph theory, a branch of mathematics, Halin's grid theorem states that the infinite graphs with thick ends are exactly the graphs containing subdivisions of the hexagonal tiling of the plane. It was published by Rudolf Halin (1965), and is a precursor to the work of Robertson and Seymour linking treewidth to large grid minors, which became an important component of the algorithmic theory of bidimensionality.".
- Halin's_grid_theorem thumbnail Tiling_Regular_6-3_Hexagonal.svg?width=300.
- Halin's_grid_theorem wikiPageExternalLink paper.pdf.
- Halin's_grid_theorem wikiPageID "38580904".
- Halin's_grid_theorem wikiPageRevisionID "539497832".
- Halin's_grid_theorem authorlink "Rudolf Halin".
- Halin's_grid_theorem first "Rudolf".
- Halin's_grid_theorem hasPhotoCollection Halin's_grid_theorem.
- Halin's_grid_theorem last "Halin".
- Halin's_grid_theorem year "1965".
- Halin's_grid_theorem subject Category:Graph_minor_theory.
- Halin's_grid_theorem subject Category:Infinite_graphs.
- Halin's_grid_theorem comment "In graph theory, a branch of mathematics, Halin's grid theorem states that the infinite graphs with thick ends are exactly the graphs containing subdivisions of the hexagonal tiling of the plane. It was published by Rudolf Halin (1965), and is a precursor to the work of Robertson and Seymour linking treewidth to large grid minors, which became an important component of the algorithmic theory of bidimensionality.".
- Halin's_grid_theorem label "Halin's grid theorem".
- Halin's_grid_theorem sameAs m.0r4kn5b.
- Halin's_grid_theorem sameAs Q5642351.
- Halin's_grid_theorem sameAs Q5642351.
- Halin's_grid_theorem wasDerivedFrom Halin's_grid_theorem?oldid=539497832.
- Halin's_grid_theorem depiction Tiling_Regular_6-3_Hexagonal.svg.
- Halin's_grid_theorem isPrimaryTopicOf Halin's_grid_theorem.
