𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Representation of proofs by colored graphs and the hadwiger conjecture

✍ Scribed by P. Yu. Suvorov

Publisher
Springer US
Year
1982
Tongue
English
Weight
578 KB
Volume
20
Category
Article
ISSN
1573-8795

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The proof of, and generalisations to, a
The proof of, and generalisations to, a conjecture by Baker and Essam
✍ S. Cardy πŸ“‚ Article πŸ“… 1973 πŸ› Elsevier Science 🌐 English βš– 830 KB

Abatnct. 'Ihe weak snd strong &-weights of a combinarorial gcomctry WC defined and reInlion-Sips between these cOnslants and other properlies of gcomctries arc obtarncd. In particular. it is shown that a geometry has cohesion n if and only if the weak k-wcrghls satisfy , =o hlCsk(4)fl' 1 forI<I<tr:

On the partition and coloring of a graph
On the partition and coloring of a graph by cliques
✍ W.D. Wallis; Guo-Hui Zhang πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 859 KB

Wallis, W.D. and G.-H. Zhang, On the partition and coloring of a graph by cliques, Discrete Mathematics 120 (1993) 191-203. We first introduce the concept of the k-chromatic index of a graph, and then discuss some of its properties. A characterization of the clique partition number of the graph G V