What people are saying - Write a review
We haven't found any reviews in the usual places.
Component Order Edge Connectivity An Introduction by Frank Boesch
Circulants and a ThreeColor Conjecture by Henry Escuadro
New Lower Bounds for Asymmetric Covering Codes by Esa A Seuranen
7 other sections not shown
Other editions - View all
2nfci 4nfci adjacent vertices algorithm Anki argument in subcase Combinatorics complete graph Component Order CONGRESSUS NUMERANTIUM 178 Conjecture connected graph consider Corollary cyclic groups degree sequence denoted detectable chromatic number diagonal distinct total T-coloring dominating set example factorization Fi,F2 fconm(G Figure floorplanning follows forcing m-convexity number forcing m-subset friendly coloring friendly index set Galois Field GF(r Graph Drawing graph G graph of order Graph Theory hamilton path independence number independent set labeling Lemma Let G lower bounds maximum m-convex set minimum mod 16mn mod 4m mod4 msvc msvc set MTNCS nodes Note number of spanning number of visible obtained path in Cay(G perfect matching polynomials for GF(rm primitive element primitive polynomial Proof queen's graph queens result semidirect product set of G spanning trees square in set subgraph Theorem threshold graph triangle boards upper bound vertex cover vertex cover problem visible lattice points Xd(Cn