Edge-disjoint trees containing some given vertices in a graph

Journal of Combinatorial Theory. Series B

Volumn 88, Issue 1, 2003, Pages 53-65

  Kriesell, Matthias ^a  

^a LEIBNIZ UNIVERSITY HANNOVER   (Germany)

Author keywords

Connected factor; Domatic number; Domination; Edge connectivity; Line graph; Spanning tree; Steiner tree

Indexed keywords

EID: 0037612010     PISSN: 00958956     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0095-8956(02)00013-8     Document Type: Article

References (11)

1. J.A. Bondy, U.S.R, Murty, Graph Theory with Applications, MacMillan, New York, 1976.
2. R. Diestel, in: Graph Theory, Graduate Texts in Mathematics, Vol. 173, Springer, Berlin, 1997.
3. R.P. Gupta, Studies in the theory of graphs, Thesis, Tata Institute of Fundamental Research, Bombay, 1967.
4. S.L. Hakimi, J. Mitchem, E. Schmeichel, Short proofs of theorems of Nash-Williams and Tutte, Ars Combin. 50 (1998) 257-266.
5. A.J.W. Hilton, The cover index, the chromatic index and the minimum degree of a graph, in: "Proceedings of the 5th British Combinatorial Conference," Aberdeen, 1975; Congr. Numer. XV (1976), 307-317.
6. A. Frank, T. Király, M. Kriesell, On decomposing a hypergraph into k connected sub-hypergraphs, submitted.
7. W. Mader, Eine Reduktionsmethode für den Kantenzusammenhang in Graphen, Math. Nachr. 93 (1979) 187-204.
8. C.St.J.A. Nash-Williams, Edge-disjoint spanning trees of finite graphs, J. London Math. Soc. 36 (1961) 445-450.
9. H. Okamura, Paths and edge connectivity in graphs, J. Combin. Theory B 37 (1984) 151-172.
10. W.T. Tutte, On the problem of decomposing a graph into n connected factors, J. London Math. Soc. 36 (1961) 221-230.
11. B. Zelinka, in: T.W. Haynes, ST. Hedetniemi, P.J. Stater (Eds.), Domatic numbers of graphs and their variants: a survey, Domination in Graphs-Advanced Topics, Marcel Dekker, Inc., New York, 1998.