On minimal arbitrarily partitionable graphs-Reference-Cited by-同舟云学术

On minimal arbitrarily partitionable graphs

Published:2012-09 Issue:17-18 Volume:112 Page:697-700
ISSN:0020-0190
Container-title:Information Processing Letters
language:en
Short-container-title:Information Processing Letters

Author:

Baudon Olivier,Przybyło Jakub,Woźniak Mariusz

Funder

Ministerstwo Nauki i Szkolnictwa Wyższego

Publisher

Elsevier BV

Subject

Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science

Reference13 articles.

1. Decomposable trees: a polynomial algorithm for tripodes;Barth;Discrete Appl. Math.,2002

2. A degree bound on decomposable trees;Barth;Discrete Math.,2006

3. On the shape of decomposable trees;Barth;Discrete Math.,2009

4. O. Baudon, F. Foucaud, J. Przybyło, M. Woźniak, On the structure of arbitrarily partitionable graphs with given connectivity, submitted for publication, available at: http://hal.archives-ouvertes.fr/docs/00/70/12/80/PDF/k-connected.pdf.

5. Arbitrarily vertex decomposable caterpillars with four or five leaves;Cichacz;Discuss. Math. Graph Theory,2006

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

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

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

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

4. Dense arbitrarily partitionable graphs;Discussiones Mathematicae Graph Theory;2016