On k-Optimum Dipath Partitions and Partial k-Colourings of Acyclic Digraphs

10Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

For an acyclic digraph G and positive integer k, we give a min-max equality for: minimum{k<℘<+<V(G)−∪℘}:℘isanode-disjointsetofdipathsinG} We prove that there exist k independent sets {Sj: j = 1, 2,..., k} such that for every optimum ℘, every P∈℘; intersects each Sj, and every dipath P in G−∪℘; intersects |P| different sets Sj. © 1986, Academic Press Inc. (London) Limited. All rights reserved.

Cite

CITATION STYLE

APA

Cameron, K. (1986). On k-Optimum Dipath Partitions and Partial k-Colourings of Acyclic Digraphs. European Journal of Combinatorics, 7(2), 115–118. https://doi.org/10.1016/S0195-6698(86)80036-1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free