𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A sufficient condition for planar graphs to be 3-colorable

✍ Scribed by O.V Borodin; A Raspaud

Book ID
108395396
Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
168 KB
Volume
88
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A sufficient condition for planar graphs
A sufficient condition for planar graphs to be acyclically 5-choosable
✍ Min Chen; AndrΓ© Raspaud πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 216 KB πŸ‘ 1 views

## Abstract A proper vertex coloring of a graph __G__ = (__V, E__) is acyclic if __G__ contains no bicolored cycle. Given a list assignment __L__ = {__L__(__v__)|__v__∈__V__} of __G__, we say __G__ is acyclically __L__‐list colorable if there exists a proper acyclic coloring Ο€ of __G__ such that Ο€(

A sufficient condition for graphs to be
A sufficient condition for graphs to be fractional -deleted graphs
✍ Sizhong Zhou πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 218 KB

graph a b s t r a c t Let G be a graph, and k a positive integer. Let h : E(G) β†’ [0, 1] be a function. If βˆ‘ eβˆ‹x h(e) = k holds for each x ∈ V (G), then we call G[F h ] a fractional k-factor of G with indicator function h where F h = {e ∈ E(G) : h(e) > 0}. A graph G is called a fractional (k, m)delet

A sufficient condition for bipartite gra
A sufficient condition for bipartite graphs to be type one
✍ Xu, Baogang πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 58 KB πŸ‘ 2 views

The total chromatic number Ο‡ T (G) of graph G is the least number of colors assigned to V (G) βˆͺ E(G) such that no adjacent or incident elements receive the same color. In this article, we give a sufficient condition for a bipartite graph G to have Ο‡ T (G) = βˆ†(G) + 1.