Brick partitions of graphs

Discrete Mathematics

Volumn 310, Issue 2, 2010, Pages 270-275

  Jackson, Bill ^a   Jordán, Tibor ^b  

^a QUEEN MARY UNIVERSITY OF LONDON   (United Kingdom)

^b EÖTVÖS LORÁND UNIVERSITY   (Hungary)

Author keywords

Bricks and superbricks; Edge disjoint spanning trees; Principal partitions

Indexed keywords

CONNECTED COMPONENT; EDGE-DISJOINT SPANNING TREES; MATROIDS; POSITIVE INTEGERS; RATIONAL NUMBERS; SUBGRAPHS; VERTEX SET;

BRICK; BRICKMAKING; BUILDING MATERIALS; PARTITIONS (BUILDING);

GRAPH THEORY;

EID: 71849119502     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2008.09.034     Document Type: Article

References (21)

1. Bruno J., and Weinberg L. The principal minors of a matroid. Linear Algebra Appl. 4 (1971) 17-54
2. Catlin P.A., Grossman J.W., Hobbs A.M., and Lai H.-J. Fractional arboricity, strength, and principal partitions in graphs and matroids. Discrete Appl. Math. 40 (1992) 285-302
3. Cunningham W.H. Optimal attack and reinforcement of a network. J. ACM 32 (1985) 549-561
4. Edmonds J. Matroid partition. In: Dantzig G.B., and Veinott Jr. A.F. (Eds). Mathematics of the Decision Sciences, Part 1 (1968), AMS, Providence, Rhode Island 335-345
5. Frank A., and Király Z. Graph orientations with edge-connection and parity constraints. Combinatorica 22 (2002) 47-70
6. Gusfield D. Connectivity and edge-disjoint spanning trees. Inform Process. Lett. 16 (1983) 87-89
7. Iri M. A review of recent work in Japan on principal partitions of matroids and their applications. Annals of the New York Academy of Sciences 319 (1979) 306-319
8. Jackson B., and Jordán T. Rigid components in molecular graphs. Algorithmica 48 (2007) 399-412
9. B. Jackson, T. Jordán, On the rigidity of molecular graphs, Combinatorica, to appear. (See also EGRES TR-2006-02). www.cs.elte.hu/egres/
10. Jackson B., and Jordán T. Pin-collinear body-and-pin frameworks and the molecular conjecture. Discrete Comput. Geom. 40 (2008) 258-278
11. B. Jackson, T. Jordán, Independence in the 3-dimensional rigidity matroid of molecular graphs (in preparation) (See also EGRES TR-2006-02). www.cs.elte.hu/egres/
12. Kishi G., and Kajitani Y. Maximally distant trees and principal partition of a linear graph. IEEE Trans. Circuit Theory 16 (1969) 323-330
13. Lin P.-M. Complementary trees in circuit theory. IEEE Trans. Circuits Systs 27 (1980) 921-928
14. Narayanan H., and Vartak N. An elementary approach to the principal partition of a matroid. Trans IECE Japan E64 (1981) 227-234
15. Nash-Williams C.St.J.A. Edge-disjoint spanning trees of finite graphs. J. London Math. Soc. 36 (1961) 445-450
16. Nash-Williams C.St.J.A. An application of matroids to graph theory. In: Rosenstiehl P. (Ed). Theory of Graphs (1967), Gordon and Breach, New York 263-265
17. Ohtsuki T., Ishizaki Y., and Watanabe H. Topological degrees of freedom and mixed analysis of electrical networks. IEEE Trans. Circuit Theory 17 (1970) 491-499
18. Schrijver A. Combinatorial Optimization (2003), Springer
19. Tay T.S., and Whiteley W. Recent advances in the generic rigidity of structures. Structural Topology 9 (1984) 31-38
20. Tomizawa N. Strongly irreducible matroids and principal partition of a matroid into strongly irreducible minors. Electron. Commun. Japan 59A (1976) 1-10
21. Tutte W.T. On the problem of decomposing a graph into n connected factors. J. London Math. Soc. 36 (1961) 221-230