A degree bound on decomposable trees-Reference-Cited by-同舟云学术

A degree bound on decomposable trees

Published:2006-03 Issue:5 Volume:306 Page:469-477
ISSN:0012-365X
Container-title:Discrete Mathematics
language:en
Short-container-title:Discrete Mathematics

Author:

Barth Dominique,Fournier Hervé

Publisher

Elsevier BV

Subject

Discrete Mathematics and Combinatorics,Theoretical Computer Science

Reference19 articles.

1. R.H. Arpaci, D.A. Patterson, The interaction of parallel and sequential workloads on a network of workstations, UC Berkeley Technical Report CS-94-830, 1994.

2. B. Awerbuch, A. Goldberg, M. Luby, S. Plotkin, Network decomposition and locality in distributed computing, in: Proceedings of the 30th IEEE Symposium on Foundations of Computer Science, May 1989.

3. B. Awerbuch, D. Peleg, Sparse partitions. in: Proceedings of the 31st IEEE Symposium on Foundations of Computer Science, October 1990, pp. 503–513.

4. Structural Complexity I;Balcázar,1995

5. D. Barth, O. Baudon, J. Puech, Networks sharing: a polynomial algorithm for tripodes, Internal Report No. 1164, L.R.I, Université de Paris Sud, 1998.

Cited by 25 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Interplays between variations of arbitrarily partitionable graphs under minimality constraints;Applied Mathematics and Computation;2024-08

2. More aspects of arbitrarily partitionable graphs;Discussiones Mathematicae Graph Theory;2020

3. Arbitraly partitionable {;2K_2,C_4}-free graphs;Discussiones Mathematicae Graph Theory;2020

4. Partitioning the Cartesian product of a tree and a cycle;Applied Mathematics and Computation;2018-09

5. Structural properties of recursively partitionable graphs with connectivity 2;Discussiones Mathematicae Graph Theory;2017