𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The fractional matching numbers of graphs

✍ Scribed by Yan Liu; Guizhen Liu

Publisher
John Wiley and Sons
Year
2002
Tongue
English
Weight
85 KB
Volume
40
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Fractional chromatic numbers of cones ov
Fractional chromatic numbers of cones over graphs
✍ Claude Tardif πŸ“‚ Article πŸ“… 2001 πŸ› John Wiley and Sons 🌐 English βš– 95 KB πŸ‘ 1 views

## Abstract We introduce a construction called the __cone__ over a graph. It is a natural generalisation of Mycielski's construction. We give a formula for the fractional chromatic numbers of all cones over graphs, which generalizes that given in 3 for Mycielski's construction. Β© 2001 John Wiley &

Circular Chromatic Numbers and Fractiona
Circular Chromatic Numbers and Fractional Chromatic Numbers of Distance Graphs
✍ G.J. Chang; L. Huang; X. Zhu πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 171 KB

This paper studies circular chromatic numbers and fractional chromatic numbers of distance graphs G(Z , D) for various distance sets D. In particular, we determine these numbers for those D sets of size two, for some special D sets of size three, for

The fractional chromatic number of infin
The fractional chromatic number of infinite graphs
✍ Imre Leader πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 398 KB πŸ‘ 1 views

## Abstract The fractional chromatic number of a graph __G__ is the infimum of the total weight that can be assigned to the independent sets of __G__ in such a way that, for each vertex __v__ of __G__, the sum of the weights of the independent sets containing __v__ is at least 1. In this note we g

The fractional chromatic number of mycie
The fractional chromatic number of mycielski's graphs
✍ Michael Larsen; James Propp; Daniel Ullman πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 236 KB

The most familiar construction of graphs whose clique number is much smaller than their chromatic number is due to Mycielski, who constructed a sequence G, of triangle-free graphs with ,y(G,) = n. In this article, w e calculate the fractional chromatic number of G, and show that this sequence of num

Girth and fractional chromatic number of
Girth and fractional chromatic number of planar graphs
✍ Amir Pirnazar; Daniel H. Ullman πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 152 KB πŸ‘ 1 views

## Abstract In 1959, even before the Four‐Color Theorem was proved, GrΓΆtzsch showed that planar graphs with girth at least 4 have chromatic number at the most 3. We examine the fractional analogue of this theorem and its generalizations. For any fixed girth, we ask for the largest possible fraction