Add to ORKGThis paper addresses upper and lower bounds for the cardinality of a maximum vertex-/edge-disjoint cycle packing in a polyhedral graph G. Bounds on the cardinality of such packings are provided, that depend on the size, the order or the number of faces of G, respectively. Polyhedral graphs are constructed, that attain these bounds
For a graph G let \mu (G) denote the cyclomatic number and let \nu (G) denote the maximum number of ...
For a graph G let \mu (G) denote the cyclomatic number and let \nu (G) denote the maximum number of ...
For a graph G let \mu (G) denote the cyclomatic number and let \nu (G) denote the maximum number of ...
This paper addresses upper and lower bounds for the cardinality of a maximum vertex-/edge-disjoint c...
AbstractFor a graph G, let ν(G) and ν′(G) denote the maximum cardinalities of packings of vertex-dis...
AbstractFor a graph G, let ν(G) and ν′(G) denote the maximum cardinalities of packings of vertex-dis...
AbstractA cycle packing in a (directed) multigraph is a vertex disjoint collection of (directed) ele...
AbstractLet G be a graph. Given an integer m<|V(G)| we obtain a lower bound for the largest number o...
Let G = (V, E) be an undirected multigraph without loops. The maximum cycle packing problem is to fi...
AbstractWe introduce a new technique for packing pairwise edge-disjoint cycles of specified lengths ...
We introduce a new technique for packing pairwise edge-disjoint cycles of specified lengths in compl...
AbstractA cycle packing in a (directed) multigraph is a vertex disjoint collection of (directed) ele...
AbstractMaximumG edge-packing is the problem of finding the maximum number of edge-disjoint isomorph...
Abstract. We study the problems to find a maximum packing of shortest edge-disjoint cycles in a grap...
A classical problem in combinatorics is, given graphs G and H, to determine if H is a subgraph of G....
For a graph G let \mu (G) denote the cyclomatic number and let \nu (G) denote the maximum number of ...
For a graph G let \mu (G) denote the cyclomatic number and let \nu (G) denote the maximum number of ...
For a graph G let \mu (G) denote the cyclomatic number and let \nu (G) denote the maximum number of ...
This paper addresses upper and lower bounds for the cardinality of a maximum vertex-/edge-disjoint c...
AbstractFor a graph G, let ν(G) and ν′(G) denote the maximum cardinalities of packings of vertex-dis...
AbstractFor a graph G, let ν(G) and ν′(G) denote the maximum cardinalities of packings of vertex-dis...
AbstractA cycle packing in a (directed) multigraph is a vertex disjoint collection of (directed) ele...
AbstractLet G be a graph. Given an integer m<|V(G)| we obtain a lower bound for the largest number o...
Let G = (V, E) be an undirected multigraph without loops. The maximum cycle packing problem is to fi...
AbstractWe introduce a new technique for packing pairwise edge-disjoint cycles of specified lengths ...
We introduce a new technique for packing pairwise edge-disjoint cycles of specified lengths in compl...
AbstractA cycle packing in a (directed) multigraph is a vertex disjoint collection of (directed) ele...
AbstractMaximumG edge-packing is the problem of finding the maximum number of edge-disjoint isomorph...
Abstract. We study the problems to find a maximum packing of shortest edge-disjoint cycles in a grap...
A classical problem in combinatorics is, given graphs G and H, to determine if H is a subgraph of G....
For a graph G let \mu (G) denote the cyclomatic number and let \nu (G) denote the maximum number of ...
For a graph G let \mu (G) denote the cyclomatic number and let \nu (G) denote the maximum number of ...
For a graph G let \mu (G) denote the cyclomatic number and let \nu (G) denote the maximum number of ...