What people are saying - Write a review
We haven't found any reviews in the usual places.
Chvatal and G Klincsek
R J Friedlander
On the SecondOrder Edge Connectivity of a Graph
19 other sections not shown
Other editions - View all
acyclic adjacent algorithm antimatroids applied assignment assume automorphism group bipartite graph C-graphs centroid centroid companion tree chordal chordal graph clique column combinatorial complete component connected construction contains convex copoint corresponding cost cycle defined definition denote difference set digraph directed graph dual graph elements equation equivalent example exists Figure finite function given graph G Graph Theory guideway Hadamard matrices Hamiltonian Hamiltonian cycle Hence hypergraph imbedding implies induced induced subgraph integer k-tree label Lemma Let G linear lower bound Math matrix matroid maximal maximum MICRAL minimal minimum number minimum path cover modules multiplications n-semiorder node obtain optimal pair partition path cover permutation planar planar graphs points polynomial poset probes problem processors Proof Proposition pseudo-similar recursive result rotations route rows satisfies segment sequence shown solution subgraph subset Suppose Theorem tournament vector vehicles vertex