𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The energy of C4-free graphs of bounded degree

✍ Scribed by V. Nikiforov

Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
92 KB
Volume
428
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Decreasing the diameter of bounded degre
Decreasing the diameter of bounded degree graphs
✍ Noga Alon; AndrΓ‘s GyΓ‘rfΓ‘s; MiklΓ³s RuszinkΓ³ πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 118 KB πŸ‘ 2 views
The maximum number of edges in 2K2-free
The maximum number of edges in 2K2-free graphs of bounded degree
✍ F.R.K. Chung; A. GyΓ‘rfΓ‘s; Z. Tuza; W.T. Trotter πŸ“‚ Article πŸ“… 1990 πŸ› Elsevier Science 🌐 English βš– 481 KB

A graph is 2K,-free if it does not contain an independent pair of edges as an induced subgraph. We show that if G is 2K,-free and has maximum degree A(G) = D, then G has at most 5D2/4 edges if D is even. If D is odd, this bound can be improved to (5D\* -20 + 1)/4. The extremal graphs are unique.

Judicious partitions of bounded-degree g
Judicious partitions of bounded-degree graphs
✍ B. BollobΓ‘s; A. D. Scott πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 118 KB πŸ‘ 1 views

## Abstract We prove results on partitioning graphs __G__ with bounded maximum degree. In particular, we provide optimal bounds for bipartitions __V__(__G__) = __V__~1~ βˆͺ __V__~2~ in which we minimize {__e__(__V__~1~), __e__(__V__~2~)}. Β© 2004 Wiley Periodicals, Inc. J Graph Theory 46: 131–143, 200

Polychromatic colorings of bounded degre
Polychromatic colorings of bounded degree plane graphs
✍ Elad Horev; Roi Krakovski πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 289 KB

## Abstract A __polychromatic k__‐__coloring__ of a plane graph __G__ is an assignment of __k__ colors to the vertices of __G__ such that every face of __G__ has __all k__ colors on its boundary. For a given plane graph __G__, one seeks the __maximum__ number __k__ such that __G__ admits a polychro