Proceedings of the Southeastern Conference on Combinatorics, Graph Theory, and Computing, Volume 11Utilitas Mathematica Pub, 1980 - Combinatorial analysis |
Contents
Chvátal and G Klincsek | 453 |
R J Friedlander | 461 |
On the SecondOrder Edge Connectivity of a Graph | 479 |
Copyright | |
20 other sections not shown
Other editions - View all
Common terms and phrases
acyclic adjacent algorithm antimatroids applied assignment assume Automated Guideway Transit automorphism group block C-graphs C₁ centroid chordal chordal graph clique Combinatorial component connected construction contains convex cost cycle defined denote difference set digraph directed graph dual graph edges elements equation equivalent example exists Figure finite function G₂ given graph G graph isomorphism Graph Theory guideway Hadamard Hadamard matrices Hamiltonian Hamiltonian cycle Hence hypergraph imbedding implies induced induced subgraph integer k-tree label Lemma Let G linear loop lower bound Math matrix maximal maximum MICRAL minimal minimum number minimum path cover modules multiplications n-semiorder node obtain optimal pair partition path cover permutation planar graphs points polynomial probes problem processors Proof Proposition pseudo-similar recursive result rotations route satisfies segment sequence shown station subgraph subset Suppose Theorem tournament V₁ vehicles vertex