Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Boxicity> ?p ?o. }
Showing items 1 to 28 of
28
with 100 items per page.
- Boxicity abstract "In graph theory, boxicity is a graph invariant, introduced by Fred S. Roberts in 1969.The boxicity of a graph is the minimum dimension in which a given graph can be represented as an intersection graph of axis-parallel boxes. That is, there must exist a one-to-one correspondence between the vertices of the graph and a set of boxes, such that two boxes intersect if and only if there is an edge connecting the corresponding vertices.".
- Boxicity thumbnail Boxicity.svg?width=300.
- Boxicity wikiPageExternalLink citation.cfm?id=1070470.
- Boxicity wikiPageExternalLink fptBoxicity.pdf.
- Boxicity wikiPageID "11167471".
- Boxicity wikiPageRevisionID "564065199".
- Boxicity hasPhotoCollection Boxicity.
- Boxicity subject Category:Geometric_graph_theory.
- Boxicity subject Category:Graph_invariants.
- Boxicity type Abstraction100002137.
- Boxicity type Cognition100023271.
- Boxicity type Concept105835747.
- Boxicity type Content105809192.
- Boxicity type Feature105849789.
- Boxicity type GraphInvariants.
- Boxicity type Idea105833840.
- Boxicity type Invariant105850432.
- Boxicity type Property105849040.
- Boxicity type PsychologicalFeature100023100.
- Boxicity comment "In graph theory, boxicity is a graph invariant, introduced by Fred S. Roberts in 1969.The boxicity of a graph is the minimum dimension in which a given graph can be represented as an intersection graph of axis-parallel boxes. That is, there must exist a one-to-one correspondence between the vertices of the graph and a set of boxes, such that two boxes intersect if and only if there is an edge connecting the corresponding vertices.".
- Boxicity label "Boxicity".
- Boxicity sameAs m.02r28pv.
- Boxicity sameAs Q4951712.
- Boxicity sameAs Q4951712.
- Boxicity sameAs Boxicity.
- Boxicity wasDerivedFrom Boxicity?oldid=564065199.
- Boxicity depiction Boxicity.svg.
- Boxicity isPrimaryTopicOf Boxicity.
