query: A Question about Cayley Graph
positive_passages.docid: 43083
positive_passages.text: Petersen graph is not a Cayley graph
negative_passages.docid: 94838
negative_passages.text: Show that a self-complementary graph contains an odd number of vertices with degree $(n-1)/2$
negative_passages.docid: 76104
negative_passages.text: Bipartite graph. average degree. Euler circuit.
negative_passages.docid: 68882
negative_passages.text: Path to Combinatorics Problem [$1.11$]
negative_passages.docid: 116932
negative_passages.text: Proving a simple graph is a connected graph
negative_passages.docid: 37754
negative_passages.text: Number of vertices of a complete graph with $n$ edges
negative_passages.docid: 113015
negative_passages.text: Eulerian Paths in a Complete Graph $K_5$
negative_passages.docid: 127965
negative_passages.text: Graph theory (Graph Connectivity)
negative_passages.docid: 10910
negative_passages.text: How many edges does an undirected tree with $n$ nodes have?
negative_passages.docid: 49193
negative_passages.text: Constructing a graph from a degree sequence
negative_passages.docid: 35458
negative_passages.text: Prove, that graph $G$ has at least $\chi(G)(\chi(G)-1)/2$ edges.
negative_passages.docid: 100978
negative_passages.text: If a graph with $n$ vertices and $n$ edges there must a cycle?
negative_passages.docid: 20544
negative_passages.text: Proving that if $G$ has a Hamiltonian circuit, then the line graph $L(G)$ also has a Hamiltonian Circuit
negative_passages.docid: 48692
negative_passages.text: A problem about the graph theory
negative_passages.docid: 84654
negative_passages.text: The graph of xy = 1 is connected or not
negative_passages.docid: 50525
negative_passages.text: Prove that $(n, n, n-1, n-1, \ldots , 4, 4, 3, 3, 2, 2, 1, 1)$ is a graphic!
negative_passages.docid: 57930
negative_passages.text: Chromatic polynomial properties