Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Domatic_number> ?p ?o. }
Showing items 1 to 37 of
37
with 100 items per page.
- Domatic_number abstract "In graph theory, a domatic partition of a graph is a partition of into disjoint sets , ,...,such that each Vi is a dominating set for G. The figure on the right shows a domatic partition of a graph; here the dominating set consists of the yellow vertices, consists of the green vertices, and consists of the blue vertices.The domatic number is the maximum size of a domatic partition, that is, the maximum number of disjoint dominating sets. The graph in the figure has domatic number 3. It is easy to see that the domatic number is at least 3 because we have presented a domatic partition of size 3. To see that the domatic number is at most 3, we first review a simple upper bound.".
- Domatic_number thumbnail Domatic-partition.svg?width=300.
- Domatic_number wikiPageID "1771980".
- Domatic_number wikiPageRevisionID "543992212".
- Domatic_number hasPhotoCollection Domatic_number.
- Domatic_number subject Category:Computational_problems_in_graph_theory.
- Domatic_number subject Category:Graph_invariants.
- Domatic_number subject Category:Graph_theory.
- Domatic_number subject Category:NP-complete_problems.
- Domatic_number type Abstraction100002137.
- Domatic_number type Attribute100024264.
- Domatic_number type Cognition100023271.
- Domatic_number type ComputationalProblemsInGraphTheory.
- Domatic_number type Concept105835747.
- Domatic_number type Condition113920835.
- Domatic_number type Content105809192.
- Domatic_number type Difficulty114408086.
- Domatic_number type Feature105849789.
- Domatic_number type GraphInvariants.
- Domatic_number type Idea105833840.
- Domatic_number type Invariant105850432.
- Domatic_number type NP-completeProblems.
- Domatic_number type Problem114410605.
- Domatic_number type Property105849040.
- Domatic_number type PsychologicalFeature100023100.
- Domatic_number type State100024720.
- Domatic_number comment "In graph theory, a domatic partition of a graph is a partition of into disjoint sets , ,...,such that each Vi is a dominating set for G. The figure on the right shows a domatic partition of a graph; here the dominating set consists of the yellow vertices, consists of the green vertices, and consists of the blue vertices.The domatic number is the maximum size of a domatic partition, that is, the maximum number of disjoint dominating sets. The graph in the figure has domatic number 3.".
- Domatic_number label "Domatic number".
- Domatic_number label "Nombre domatique".
- Domatic_number sameAs Nombre_domatique.
- Domatic_number sameAs m.05vr7h.
- Domatic_number sameAs Q3343067.
- Domatic_number sameAs Q3343067.
- Domatic_number sameAs Domatic_number.
- Domatic_number wasDerivedFrom Domatic_number?oldid=543992212.
- Domatic_number depiction Domatic-partition.svg.
- Domatic_number isPrimaryTopicOf Domatic_number.