✦ LIBER ✦

On embedding graphs with bounded sum of size and maximum degree

✍ Scribed by Żak, Andrzej

Book ID: 122307573
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 400 KB
Volume: 329
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2014.04.001

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Neighbor sum distinguishing edge colorin

Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree

✍ Dong, Aijun; Wang, Guanghui; Zhang, Jianghua 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 473 KB

Sum Coloring of Bipartite Graphs with Bo

Sum Coloring of Bipartite Graphs with Bounded Degree

✍ Michal Malafiejski; Krzysztof Giaro; Robert Janczewski; Marek Kubale 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 580 KB

On Size Ramsey Numbers of Graphs with Bo

On Size Ramsey Numbers of Graphs with Bounded Degree

✍ Vojtěch Rödl; Endre Szemerédi 📂 Article 📅 2000 🏛 Springer-Verlag 🌐 English ⚖ 144 KB

Graphs with maximum size and lower bound

Graphs with maximum size and lower bounded girth

✍ E. Abajo; A. Diánez 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 230 KB

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

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.