𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The polyhedron of a problem on an m-vertex subgraph of a complete graph

✍ Scribed by S.N. Greshnev

Publisher
Elsevier Science
Year
1984
Weight
249 KB
Volume
24
Category
Article
ISSN
0041-5553

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Vertex decompositions of sparse graphs i
Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k
✍ O. V. Borodin; A. O. Ivanova; M. Montassier; P. Ochem; A. Raspaud πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 127 KB

## Abstract A graph __G__ is (__k__,0)‐colorable if its vertices can be partitioned into subsets __V__~1~ and __V__~2~ such that in __G__[__V__~1~] every vertex has degree at most __k__, while __G__[__V__~2~] is edgeless. For every integer __k__β©Ύ0, we prove that every graph with the maximum average

On a conjecture of Gallai concerning com
On a conjecture of Gallai concerning complete subgraphs of k-critical graphs
✍ H.L. Abbott; B. Zhou πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 418 KB

Abbott, H.L. and B. Zhou, On a conjecture of Gallai concerning complete subgraphs of k-critical graphs, Discrete Mathematics 100 (1992) 223-228. A graph G is said to be k-critical if it has chromatic number k but every proper subgraph of G has a (k -l)-coloring. T. Gallai asked whether each k-criti

On the linear vertex-arboricity of a pla
On the linear vertex-arboricity of a planar graph
✍ K. S. Poh πŸ“‚ Article πŸ“… 1990 πŸ› John Wiley and Sons 🌐 English βš– 153 KB πŸ‘ 2 views

## Abstract We prove in this note that the linear vertex‐arboricity of any planar graph is at most three, which confirms a conjecture due to Broere and Mynhardt, and others.