Graphs and Applications: Proceedings of the First Colorado Symposium on Graph Theory |
What people are saying - Write a review
We haven't found any reviews in the usual places.
Contents
F Boesch and R Tindell | 53 |
G Chartrand and R J Wilson | 69 |
7 | 106 |
Copyright | |
2 other sections not shown
Common terms and phrases
adjacent algorithms appear applying assigned assume automorphism bipartite graph block graph bound called characterization chromatic number color column competition graph complete components conjecture connected consider construction contains copy corresponding cover cycle defined denote Department of Mathematics determine diameter digraph distinct dual edges elements embedding empire equal exactly example exists fact factor Figure finite four genus give given graph G Graph Theory hamiltonian handles Harary Hence holds independent induced integer interval joining known least Lemma length Let G lines lower Math matrix maximum minimal blocks natural Note obtained packing pair path Petersen graph planar graph plane points possible present problem proof prove question regions regular respectively result satisfies shown snarks splitting subgraph subset Suppose surface Theorem tree University vertex vertices
Bibliographic information
| Title | Graphs and Applications: Proceedings of the First Colorado Symposium on Graph Theory A Wiley-Interscience publication Proceedings of the First Colorado Symposium on Graph Theory |
| Authors | Frank Harary, John Stanley Maybee |
| Editors | Frank Harary, John Stanley Maybee |
| Contributors | Colorado Symposium on Graph Theory (1, 1982, Boulder, Colo.), Colorado Symposium on Graph Theory. 1, 1982, Boulder, Colo.. |
| Edition | illustrated |
| Publisher | Wiley, 1985 |
| Original from | the University of Michigan |
| Digitized | Feb 2, 2010 |
| ISBN | 0471887722, 9780471887720 |
| Length | 347 pages |
| Export Citation | BiBTeX EndNote RefMan |