query: Number of ways to remove nodes from a graph with certain restrictions
positive_passages.docid: 151152
positive_passages.text: Removing nodes from graphs such that one is dependent on other - ZIO $2010$, P$1$
negative_passages.docid: 97630
negative_passages.text: A graph which is not a single block has at least two leaf blocks
negative_passages.docid: 99245
negative_passages.text: Algorithm for diameter of graph?
negative_passages.docid: 153227
negative_passages.text: Connected graph with minimum distance
negative_passages.docid: 78685
negative_passages.text: How to find all proper colorings (four coloring) of a graph with a brute force algorithm
negative_passages.docid: 133436
negative_passages.text: Inclusion-Exclusion: INTELLIGENT permutations
negative_passages.docid: 6432
negative_passages.text: How many ways can N elements be partitioned into subsets of size K?
negative_passages.docid: 117349
negative_passages.text: counting triangles in a graph or its complement
negative_passages.docid: 137072
negative_passages.text: Number Of Distinct Paths In A Rectangular Grid
negative_passages.docid: 138465
negative_passages.text: Graph Coloring and Complete Graph
negative_passages.docid: 65622
negative_passages.text: Maximum edges in a square free graph
negative_passages.docid: 83206
negative_passages.text: How to delete all nodes of a given content type?
negative_passages.docid: 49045
negative_passages.text: Graph theory: Tree holds two sub-tree with an amount of vertices
negative_passages.docid: 19807
negative_passages.text: Connected graph with colored edges
negative_passages.docid: 99931
negative_passages.text: Number of connected graphs on labeled vertices, counted according to parity
negative_passages.docid: 102539
negative_passages.text: Min. number of vertices in graph as function of $\kappa(G)$ and $\operatorname{diam}(G)$
negative_passages.docid: 116647
negative_passages.text: The number of different ways to choose $k$ out of $n$ unique items