What people are saying - Write a review
We haven't found any reviews in the usual places.
Chvatal and C Klincsek
R J Friedlander
On the SecondOrder Edge Connectivity of a Graph
9 other sections not shown
Other editions - View all
adjacent algorithm antimatroids assignment block byte cc(G chordal graph clique column combinatorial conjecture connected graph construction contains convex convex set copoint cycle defined denote difference set digraph example exists Figure finite function given graceful valuation graph G Graph Theory grid Hamilton-laceable graph Hamiltonian Hamiltonian cycle Hence homeomorphic hypergraphs imbedding independent set induced interval graphs isomorphism k-tree labelled Lemma length Let G linear lower bound macro Math matrix matroid maximal maximum MICRAL minimal minimum number minimum path cover modules multiplications node number of edges obtain optimal pair partial order partition permutation points polynomials poset positive integer probes problem processors Proof Proposition recursive result rows search tree segment sequence serf Sheffer sequence shown SPITBOL subgraph homeomorphic subset Suppose Theorem threshold graph tournament upper bound vertex vertices of G