Properties of Certain Families of 2k-Cycle-Free Graphs
โ Scribed by F Lazebnik; V.A Ustimenko; A.J Woldar
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 233 KB
- Volume
- 60
- Category
- Article
- ISSN
- 0095-8956
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
## Abstract Laman's characterization of minimally rigid 2โdimensional generic frameworks gives a matroid structure on the edge set of the underlying graph, as was first pointed out and exploited by L. Lovรกsz and Y. Yemini. Global rigidity has only recently been characterized by a combination of two
For a graph F and natural numbers a 1 ; . . . ; a r ; let F ! รฐa 1 ; . . . ; a r ร denote the property that for each coloring of the edges of F with r colors, there exists i such that some copy of the complete graph K ai is colored with the ith color. Furthermore, we write รฐa 1 ; . . . ; a r ร ! รฐb
For graphs F, G 1 , ..., G r , we write F Q (G 1 , ..., G r ) if for every coloring of the vertices of F with r colors there exists i, i=1, 2, ..., r, such that a copy of G i is colored with the ith color. For two families of graphs G 1 , ..., G r and H 1 , ..., H s , by .., H s ) for every graph F