๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On a conjecture of berge

โœ Scribed by S.E Markosian; G.S Gasparian; A.S Markosian

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
652 KB
Volume
56
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On the bergeโ€”sauer conjecture
On the bergeโ€”sauer conjecture
โœ K. R. Parthasarathy; S. Sridharan ๐Ÿ“‚ Article ๐Ÿ“… 1982 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 115 KB

## Abstract It is proved that a simple 4โ€regular graph without __K__~1,3~ as an induced subgraph has a 3โ€regular subgraph.

On the Berge's strong path partition con
On the Berge's strong path partition conjecture
โœ S. Sridharan ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 312 KB

Sridharan, S., On the Berge's strong path partition conjecture, Discrete Mathematics 112 (1993) 289-293. It is proved that for every k-optimal path partition of a digraph in which each component contains at most one cycle, there exists a partial k-coloring which colors strongly every path of the pa

On conjectures of Berge and Chvรกtal
On conjectures of Berge and Chvรกtal
โœ Mario Gionfriddo; Zsolt Tuza ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 533 KB

We investigate the relations among the chromatic index q(X), the maximum degree d(Z), the total chromatic number q\*(Z), and the maximum size d,(Z) of an intersecting subhypergraph of a hypergraph Z: For some particular classes of hypergraphs, including Steiner systems, we provide sufficient conditi

A unified approach to known and unknown
A unified approach to known and unknown cases of Berge's conjecture
โœ Eli Berger; Irith Ben-Arroyo Hartman ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 185 KB

## Abstract Berge's elegant dipath partition conjecture from 1982 states that in a dipath partition __P__ of the vertex set of a digraph minimizing , there exists a collection __C__^__k__^ of __k__ disjoint independent sets, where each dipath __P__โˆˆ__P__ meets exactly min{|__P__|, __k__} of the ind