24 pages matching spanning tree in this book
Results 1-3 of 24
What people are saying - Write a review
We haven't found any reviews in the usual places.
Other editions - View all
1-factorization 5TH S-E CONF adjacency matrix algorithm arithmetic progression automorphism balanced design blocks bound chromatic number circuit clique coloring column COMBINATORICS complete components COMPUTING connected graph consider construction contains coordinate Corollary corresponding cosets cubic graph cycle defined degree denote digraph disjoint edges elements exactly example exists finite functions given graph G GRAPH THEORY Hamiltonian Hence homeomorphic independence graphs independent set induced intersection graph interval graph isomorphic Latin square Lemma length Let G Math matroid maximum minimum forest n-coloring n-tuple nodes number of vertices obtained optional points orbit pair palindrome parameters partition path permutation planar plane graph points of G polynomial algorithm positive integers problem PROC Proof quadratic residue quadruples result rows self-complementary self-dual codes sequence spanning tree starter strongly regular graphs subgraph of G subsets subsquare Suppose Theorem triple two-graph values vector vertex