Proceedings of the Southeastern Conference on Combinatorics, Graph Theory, and ComputingUtilitas Mathematica Pub, 1986 - Combinatorial analysis |
Contents
Archdeacon Coverings of Graphs by Cycles | 7 |
Abello Algorithms for Consistent Sets | 23 |
Archdeacon and B Richter Circuits in 4Regular Plane Graphs | 39 |
Copyright | |
6 other sections not shown
Other editions - View all
Common terms and phrases
adjacency matrix adjacent algorithm bc(D biclique biclique covering binary bipartite graph blocks chordal chordal graph chromatic chromatic polynomial clique color complete graph Computer configuration conjecture conprimal consider construct contains Corollary cubic graph cycle decomposition defined definition degree denote digraph disjoint dominates embedding endnode endpoints exists Figure finite graph G Graph Theory grid graphs Hamiltonian path Hence homomorphism implies independent set induced induced subgraph isomorphic k-tree latin squares least Lemma Let G linear lines Math matrix matroid maximal maximum minimal minimum element minimum number molecules nodes NP-complete number of edges number of vertices obtained oval P-bipartition pair partition permutation graphs Petersen graph plane points polygon polynomial problem processors Proof properties prove quadrangle R₁ R₂ result S₁ satisfies segment sequence spanning tree Steinhaus tournaments Stirling graph subgraph subplane subset Suppose Theorem U₁ V₁ vertex W₁