Halin's grid theorem
http://dbpedia.org/resource/Halin's_grid_theorem an entity of type: Abstraction100002137
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, 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.
rdf:langString
rdf:langString
Halin's grid theorem
xsd:integer
38580904
xsd:integer
1052425981
rdf:langString
Rudolf Halin
rdf:langString
Rudolf
rdf:langString
Halin
xsd:integer
1965
rdf:langString
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, 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.
xsd:nonNegativeInteger
7247
