686 search results - page 56 / 138 » Packing Cycles in Graphs |
COMBINATORICS
2006
15 years 16 days ago
2006
We present a decomposition formula for the weighted zeta function of an irregular covering of a graph by its weighted L-functions. Moreover, we give a factorization of the weighte...
119
click to vote
JGAA
2008
15 years 14 days ago
2008
In a convex drawing of a plane graph, all edges are drawn as straight-line segments without any edge-intersection and all facial cycles are drawn as convex polygons. In a convex gr...
96
Voted
JCT
2010
14 years 11 months ago
2010
In the symmetric group on a set of size 2n, let P2n denote the conjugacy class of involutions with no fixed points (equivalently, we refer to these as “pairings”, since each ...
DAM
2008
15 years 17 days ago
2008
For a graph G, let fij be the number of spanning rooted forests in which vertex j belongs to a tree rooted at i. In this paper, we show that for a path, the fij's can be expr...
103
Voted
AAIM
2009
Springer
15 years 7 months ago
2009
Springer
We study restricted improvement cycles (ri-cycles) in finite positional n-person games with perfect information modeled by directed graphs (digraphs) that may contain cycles. We o...