The Path-Numbers of Some Multipartite Graphs
1980; Elsevier BV; Linguagem: Inglês
10.1016/s0167-5060(08)70061-x
ISSN2543-1099
Autores Tópico(s)Graph Labeling and Dimension Problems
ResumoPublisher Summary This chapter discusses path-numbers of multipartite graphs. Let G be a graph and ҫ a family of paths of G. If each edge of G lies on at least one element of ҫ, ҫ is a path-covering of G; if each edge of G lies on exactly one element of ҫ, P is a path-partition of G.
Referência(s)