On a matrix partition conjecture
✍ Scribed by Richard A Brualdi; Geňa Hahn; Peter Horak; E.S Kramer; Stephen Mellendorf; Dale M Mesner
- Book ID
- 103510335
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 673 KB
- Volume
- 69
- Category
- Article
- ISSN
- 0097-3165
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
In 1963, Vizing [Vichysl. Sistemy 9 (19631, 30-431 conjectured that y ( G X H) 2 y ( G ) y ( H ) , where G X Hdenotes the Cartesian product of graphs, and y(G) is the domination number. In this paper we define the extraction number x(G) and w e prove that ## M G ) 5 x(G) 5 y(G), and y ( G x H) 2 x
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