Proceedings of the Southeastern Conference on Combinatorics, Graph Theory, and ComputingUtilitas Mathematica Pub., 1974 - Combinatorial analysis |
From inside the book
Results 1-3 of 42
Page 32
... combinatorial computations : a survey . Symposium on Computers and Automata ( 1971 ) 305-311 . Lawler , E.L. A ... Theory of Graphs : International Symposium . Ed . P. and Breach ( 1967 ) 215-232 . Rosenstiehl . Gordon Li 68 Liu , C.L. ...
... combinatorial computations : a survey . Symposium on Computers and Automata ( 1971 ) 305-311 . Lawler , E.L. A ... Theory of Graphs : International Symposium . Ed . P. and Breach ( 1967 ) 215-232 . Rosenstiehl . Gordon Li 68 Liu , C.L. ...
Page 155
... combinatorial theory : Combinatorial Geometries , Mimeographed Notes , MIT 1968 . R. Halin , Uber unendliche Wege in Graphen , Math . Ann . 157 ( 1968 ) 125-137 . F. Harary , Graph Theory , Addison - Wesley Publ . Comp . , Reading ...
... combinatorial theory : Combinatorial Geometries , Mimeographed Notes , MIT 1968 . R. Halin , Uber unendliche Wege in Graphen , Math . Ann . 157 ( 1968 ) 125-137 . F. Harary , Graph Theory , Addison - Wesley Publ . Comp . , Reading ...
Page 186
... Combinatorial Theory Ser . B. Berge , [ 3 ] C. [ 4 ] W. Haken , Graphes et Hypergraphs , Dunod , Paris , 1970 . " An Existence Theorem for Planar Maps " , Journal of Combinatorial Theory ( 14 ) B , 1973 . [ 5 ] H. Heesch , " Chromatic ...
... Combinatorial Theory Ser . B. Berge , [ 3 ] C. [ 4 ] W. Haken , Graphes et Hypergraphs , Dunod , Paris , 1970 . " An Existence Theorem for Planar Maps " , Journal of Combinatorial Theory ( 14 ) B , 1973 . [ 5 ] H. Heesch , " Chromatic ...
Other editions - View all
Common terms and phrases
1-factorization 5TH S-E CONF adjacency matrix algorithm automorphism balanced design blocks bound chromatic number circuit clique coloring COMBINATORICS complete components COMPUTING connected graph consider construction contains coordinate Corollary corresponding cosets cubic graph cycle defined degree denote digraph disjoint edges elements exactly example exists finite functions G₁ G₂ given graph G GRAPH THEORY Hamiltonian Hence homeomorphic independence graphs independent set induced intersection graph interval graph isomorphic Latin square Lemma Let G Math matroid maximum minimum forest n-coloring n-tuple nodes NP-complete number of vertices obtained optional points orbits pair palindrome parameters partition path permutation planar plane graph polynomial algorithm positive integers problem PROC Proof quadratic residue regular graphs result rows S₁ self-complementary self-dual codes sequence spanning tree starter strongly regular graphs subsets subsquare Suppose Theorem triple two-graph V₁ values vector vertex weight