Oriented star packings-Reference-Cited by-同舟云学术

Oriented star packings

Published:2008-05 Issue:3 Volume:98 Page:558-576
ISSN:0095-8956
Container-title:Journal of Combinatorial Theory, Series B
language:en
Short-container-title:Journal of Combinatorial Theory, Series B

Author:

Brewster Richard C.,Hell Pavol,Rizzi Romeo

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science

Reference17 articles.

1. Packing paths in digraphs;Brewster;J. Graph Theory,2003

2. R.C. Brewster, P. Hell, R. Rizzi, Sidepath results on packing P1's and P2's. Technical Report DIT-03-008, Dipartimento di Informatica e Telecomunicazioni, Università degli Studi di Trento, 38050 Trento, Italy

3. Digraph packings with hypomatchable graphs and propellers;Brewster;Inform. Process. Lett.,2003

4. Packing subgraphs in a graph;Cornuéjols;Oper. Res. Lett.,1982

5. Paths, trees, and flowers;Edmonds;Canad. J. Math.,1965

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

1. On star family packing of graphs;RAIRO - Operations Research;2021-07

2. Polynomially Bounding the Number of Minimal Separators in Graphs: Reductions, Sufficient Conditions, and a Dichotomy Theorem;The Electronic Journal of Combinatorics;2021-02-26

3. Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure;SIAM Journal on Discrete Mathematics;2021-01

4. Equistarable bipartite graphs;Discrete Mathematics;2016-07

5. Modelling the Effects of Selection Temperature and Mutation on the Prisoner’s Dilemma Game on a Complete Oriented Star;PLoS ONE;2014-10-14