Path decompositions of chains and circuits
Expressions for the path polynomials (see Farrell [1]) of chains and circuits are derived. These polynomials are then used to deduce results about node disjoint path decompositions of chains and circuits. Some results are also given for decompositions in which specific paths must be used.
Main Author: | E. J. Farrell |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
1983-01-01
|
Series: | International Journal of Mathematics and Mathematical Sciences |
Subjects: | |
Online Access: | http://dx.doi.org/10.1155/S0161171283000472 |
Similar Items
-
On a class of polynomials associated with the paths in a graph and its application to minimum nodes disjoint path coverings of graphs
by: E. J. Farrell
Published: (1983-01-01) -
Decomposition of Complete Bipartite Multigraphs Into Paths and Cycles Having k Edges
by: Jeevadoss Shanmugasundaram, et al.
Published: (2015-11-01) -
Decomposition of product graphs into paths and stars on five vertices
by: M. Ilayaraja, et al.
Published: (2020-09-01) -
On coefficients of path polynomials
by: E. J. Farrell
Published: (1984-01-01) -
Edge decompositions of multigraphs into multi-2-paths
by: Jan Kratochvil, et al.
Published: (2004-01-01)