Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Intersection_number_(graph_theory)> ?p ?o. }
Showing items 1 to 32 of
32
with 100 items per page.
- Intersection_number_(graph_theory) abstract "In the mathematical field of graph theory, the intersection number of a graph G = (V,E) is the smallest number of elements in a representation of G as an intersection graph of finite sets. Equivalently, it is the smallest number of cliques needed to cover all of the edges of G.".
- Intersection_number_(graph_theory) thumbnail Erdős–Faber–Lovász_conjecture.svg?width=300.
- Intersection_number_(graph_theory) wikiPageID "31087478".
- Intersection_number_(graph_theory) wikiPageRevisionID "602766783".
- Intersection_number_(graph_theory) hasPhotoCollection Intersection_number_(graph_theory).
- Intersection_number_(graph_theory) title "Intersection Number".
- Intersection_number_(graph_theory) urlname "IntersectionNumber".
- Intersection_number_(graph_theory) subject Category:Graph_invariants.
- Intersection_number_(graph_theory) subject Category:Intersection_classes_of_graphs.
- Intersection_number_(graph_theory) type Abstraction100002137.
- Intersection_number_(graph_theory) type Class107997703.
- Intersection_number_(graph_theory) type Cognition100023271.
- Intersection_number_(graph_theory) type Collection107951464.
- Intersection_number_(graph_theory) type Concept105835747.
- Intersection_number_(graph_theory) type Content105809192.
- Intersection_number_(graph_theory) type Feature105849789.
- Intersection_number_(graph_theory) type GraphInvariants.
- Intersection_number_(graph_theory) type Group100031264.
- Intersection_number_(graph_theory) type Idea105833840.
- Intersection_number_(graph_theory) type IntersectionClassesOfGraphs.
- Intersection_number_(graph_theory) type Invariant105850432.
- Intersection_number_(graph_theory) type Property105849040.
- Intersection_number_(graph_theory) type PsychologicalFeature100023100.
- Intersection_number_(graph_theory) comment "In the mathematical field of graph theory, the intersection number of a graph G = (V,E) is the smallest number of elements in a representation of G as an intersection graph of finite sets. Equivalently, it is the smallest number of cliques needed to cover all of the edges of G.".
- Intersection_number_(graph_theory) label "Intersection number (graph theory)".
- Intersection_number_(graph_theory) sameAs m.0jt27mw.
- Intersection_number_(graph_theory) sameAs Q17101799.
- Intersection_number_(graph_theory) sameAs Q17101799.
- Intersection_number_(graph_theory) sameAs Intersection_number_(graph_theory).
- Intersection_number_(graph_theory) wasDerivedFrom Intersection_number_(graph_theory)?oldid=602766783.
- Intersection_number_(graph_theory) depiction Erdős–Faber–Lovász_conjecture.svg.
- Intersection_number_(graph_theory) isPrimaryTopicOf Intersection_number_(graph_theory).
