Name
Abstract | ||
|---|---|---|
The main result of the paper is a characterization of connected graphs H with the property: For any graph G , the subsets of vertices that can be saturated by packing edges of G and copies of H are independent sets of a matroid. |
Year | DOI | Venue |
|---|---|---|
1988 | 10.1016/0095-8956(88)90042-1 | Journal of Combinatorial Theory |
Field | DocType | Volume |
Pseudoforest,Matroid,Discrete mathematics,Combinatorics,Line graph,k-edge-connected graph,Dual graph,Graphic matroid,Factor-critical graph,Mathematics,Branch-decomposition | Journal | 44 |
Issue | ISSN | Citations |
3 | Journal of Combinatorial Theory, Series B | 13 |
PageRank | References | Authors |
1.42 | 7 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Martin Loebl | 1 | 152 | 28.66 |
| Svatopluk Poljak | 2 | 628 | 220.87 |