✦ LIBER ✦

SparseH-Colourable Graphs of Bounded Maximum Degree

✍ Scribed by Hossein Hajiabolhassan; Xuding Zhu

Publisher: Springer Japan
Year: 2004
Tongue: English
Weight: 312 KB
Volume: 20
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-003-0542-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Induced-Universal Graphs for Graphs with

Induced-Universal Graphs for Graphs with Bounded Maximum Degree

✍ Steve Butler 📂 Article 📅 2009 🏛 Springer Japan 🌐 English ⚖ 213 KB

Decompositions of graphs into forests wi

Decompositions of graphs into forests with bounded maximum degree

✍ Mirosław Truszczyński 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 995 KB

Truszczydski, M., Decompositions of graphs into forests with bounded maximum degree, Discrete Mathematics 98 (1991) 207-222.

On Induced Ramsey Numbers for Graphs wit

On Induced Ramsey Numbers for Graphs with Bounded Maximum Degree

✍ Tomasz Łuczak; Vojtěch Rödl 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 435 KB

For graphs G and H we write G wÄ ind H if every 2-edge colouring of G yields an induced monochromatic copy of H. The induced Ramsey number for H is defined as r ind (H)=min[ |V(G)|: G wÄ ind H]. We show that for every d 1 there exists an absolute constant c d such that r ind (H n, d ) n cd for every

Maximal Trees with Bounded Maximum Degre

Maximal Trees with Bounded Maximum Degree in a Graph

✍ Noga Alon; Mario Szegedy 📂 Article 📅 1998 🏛 Springer Japan 🌐 English ⚖ 123 KB

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