Partitioning a graph into alliance free sets (Q1025928): Difference between revisions

@@ Property / cites work @@
+Unfriendly partitions of a graph
@@ Property / cites work: Unfriendly partitions of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+The satisfactory partition problem
@@ Property / cites work: The satisfactory partition problem / rank @@
+Normal rank
@@ Property / cites work @@
+On a theorem about vertex colorings of graphs
@@ Property / cites work: On a theorem about vertex colorings of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On an upper bound of the graph's chromatic number, depending on the graph's degree and density
+Normal rank
@@ Property / cites work @@
+Powerful alliances in graphs
@@ Property / cites work: Powerful alliances in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Decomposing graphs with girth at least five under degree constraints
+Normal rank
@@ Property / cites work @@
+Offensive alliances in graphs
@@ Property / cites work: Offensive alliances in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Partition of graphs with condition on the connectivity and minimum degree
+Normal rank
@@ Property / cites work @@
+Global defensive alliances in graphs
@@ Property / cites work: Global defensive alliances in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4820818
@@ Property / cites work: Q4820818 / rank @@
+Normal rank
@@ Property / cites work @@
+On decomposition of triangle-free graphs under degree constraints
+Normal rank
@@ Property / cites work @@
+Q4405794
@@ Property / cites work: Q4405794 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5488895
@@ Property / cites work: Q5488895 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4472692
@@ Property / cites work: Q4472692 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3211331
@@ Property / cites work: Q3211331 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4715286
@@ Property / cites work: Q4715286 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph decomposition with constraints on the connectivity and minimum degree
+Normal rank