On label graphoidal covering number-I
Let G = (V,E) be a graph with p vertices and q edges. An acyclicgraphoidal cover of G is a collection of paths in G which are internallydisjointand covering each edge of the graph exactly once. Let f : V !{1, 2, . . . , p} be a bijective labeling of the vertices of G. Let " Gf bethe directed graph o...
Tallennettuna:
| Päätekijät: | , |
|---|---|
| Aineistotyyppi: | Artigo |
| Kieli: | Inglês |
| Julkaistu: |
University of Isfahan
2012-12-01
|
| Sarja: | Transactions on Combinatorics |
| Aiheet: | |
| Linkit: | http://www.combinatorics.ir/?_action=showPDF&article=2271&_ob=ac97bba24799ba01acbe600e2d71d194&fileName=full_text.pdf. |
| Tagit: |
Ei tageja, Lisää ensimmäinen tagi!
|