Dense on-line arbitrarily partitionable graphs-Reference-Cited by-同舟云学术

Dense on-line arbitrarily partitionable graphs

Published:2017-07 Issue: Volume:226 Page:71-77
ISSN:0166-218X
Container-title:Discrete Applied Mathematics
language:en
Short-container-title:Discrete Applied Mathematics

Author:

Kalinowski Rafał^ORCID

Funder

Polish Ministry of Science and Higher Education

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference20 articles.

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

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

3. On the Cartesian product of an arbitrarily partitionable graph and a traceable graph;Baudon;Discrete Math. Theor. Comput. Sci.,2014

4. Partitioning powers of traceable or hamiltonian graphs;Baudon;Theoret. Comput. Sci.,2014

5. M. Bednarz, A. Burkot, A. Dudzik, J. Kwaśny, K. Pawłowski, Small dense on-line arbitrarily partitionable graphs, preprint http://www.ii.uj.edu.pl/preMD.

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

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

2. Small dense on-line arbitrarily partitionable graphs;Applied Mathematics and Computation;2024-06

3. Arbitrary partitionability of product graphs;Applied Mathematics and Computation;2021-11

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

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