Bounding the crossing number of a graph in terms of the crossing number of a minor with small maximum degree
โ Scribed by Enrique Garcia-Moreno; Gelasio Salazar
- Publisher
- John Wiley and Sons
- Year
- 2001
- Tongue
- English
- Weight
- 76 KB
- Volume
- 36
- Category
- Article
- ISSN
- 0364-9024
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Let f (v, e, ฮป) denote the maximum number of proper vertex colorings of a graph with v vertices and e edges in ฮป colors. In this paper we present some new upper bounds for f (v, e, ฮป). In particular, a new notion of pseudoproper colorings of a graph is given, which allows us to significantly improve
Investigating the reaction of a number of gel electrophoresis cross-linkers with b-lactoglobulin by matrix assisted laser desorption/ionizationmass spectrometry A number of cross-linkers that are commonly used in polyacrylamide gels have been incubated with bovine b-lactoglobulin B and the resulting