Proceedings of the Southeastern Conference on Combinatorics, Graph Theory, and Computing, Volume 17 |
What people are saying - Write a review
We haven't found any reviews in the usual places.
Contents
Archdeacon Coverings of Graphs by Cycles | 15 |
Archdeacon and B Richter Circuits in 4Regular Plane Graphs | 39 |
K H Baik and L L Miller | 63 |
Copyright | |
16 other sections not shown
Other editions - View all
Common terms and phrases
additive permutations adjacency matrix adjacent algorithm biclique binary bipartite graph blocks chemical chordal graph chromatic polynomial clique covering color complete graph configuration conjecture connected graph conprimal consider construct contains Corollary cubic graph cycle decomposition defined definition degree denote digraph disjoint dominates elements embedding endpoints example exists Figure finite graph G Graph Theory grid graphs Hamiltonian path Hence homomorphism implies independent set induced induced subgraph isomorphic latin squares least Lemma Let G linear lines lower bound Math Mathematics matrix matroid maximal maximum minimal minimum number molecules nodes NP-complete number of edges number of vertices obtained oval P-bipartition pair partition permutation graphs Petersen graph points polygon positive integer prime problem processors Proof properties Proposition prove quadrangle rectangles rectangular grid graphs relation result satisfies set of vertices spanning tree Steinhaus subplane subset Suppose Theorem topological tournament unimodal values vertex
Bibliographic information
| Title | Proceedings of the Southeastern Conference on Combinatorics, Graph Theory, and Computing, Volume 17 Congressus numerantium; 17, etc |
| Publisher | Utilitas Mathematica Pub, 1986 |
| Original from | the University of California |
| Digitized | Dec 18, 2010 |
| ISBN | 0919628532, 9780919628533 |
| Export Citation | BiBTeX EndNote RefMan |