✦ LIBER ✦

General lower bound on the size of\((H;k)\)-stable graphs

✍ Scribed by Żak, Andrzej

Book ID: 120694250
Publisher: Springer US
Year: 2013
Tongue: English
Weight: 152 KB
Volume: 29
Category: Article
ISSN: 1382-6905
DOI: 10.1007/s10878-013-9595-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A lower bound on the size of -vertex sta

A lower bound on the size of -vertex stable graphs

✍ Sylwia Cichacz; Agnieszka Görlich; Mateusz Nikodem; Andrzej Żak 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 246 KB

A tight lower bound on the size of visib

A tight lower bound on the size of visibility graphs

✍ Xiaojun Shen; Herbert Edelsbrunner 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 451 KB

Maximum lower bound on embedding areas o

Maximum lower bound on embedding areas of general graphs

✍ Koichi Wada; Kimio Kawaguchi; Hideyuki Fujishima 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 932 KB

Bounds on the lower size of A 7-critical

Bounds on the lower size of A 7-critical graph

✍ Huanping Liu; Zhongfu Zhang; Dean Shen 📂 Article 📅 1994 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 307 KB

Lower bounds on the OBDD size of two fun

Lower bounds on the OBDD size of two fundamental functions' graphs

✍ Daniel Sawitzki 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 155 KB

New lower bounds for the size of edge ch

New lower bounds for the size of edge chromatic critical graphs

✍ Yue Zhao 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 108 KB 👁 1 views

## Abstract In this paper, by applying the discharging method, we obtain new lower bounds for the size of edge chromatic critical graphs for small maximum degree Δ. © 2004 Wiley Periodicals, Inc. J Graph Theory 46: 81–92, 2004