✦ LIBER ✦

Domination Number of Graphs Without Small Cycles

✍ Scribed by Xue-gang Chen; Moo Young Sohn

Publisher: Springer Japan
Year: 2011
Tongue: English
Weight: 167 KB
Volume: 27
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-010-1004-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Total Colorings of Planar Graphs without

Total Colorings of Planar Graphs without Small Cycles

✍ Jianfeng Hou; Yan Zhu; Guizhen Liu; Jianliang Wu; Mei Lan 📂 Article 📅 2008 🏛 Springer Japan 🌐 English ⚖ 197 KB

Acyclic 5-choosability of planar graphs

Acyclic 5-choosability of planar graphs without small cycles

✍ Mickaël Montassier; André Raspaud; Weifan Wang 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 188 KB 👁 1 views

## Abstract A proper vertex coloring of a graph __G__ = (__V,E__) is acyclic if __G__ contains no bicolored cycle. A graph __G__ is acyclically __L__‐list colorable if for a given list assignment __L__ = {__L__(__v__): __v__: ∈ __V__}, there exists a proper acyclic coloring ϕ of __G__ such that ϕ(_

Acyclic Edge Coloring of Planar Graphs W

Acyclic Edge Coloring of Planar Graphs Without Small Cycles

✍ Jianfeng Hou; Guizhen Liu; Jianliang Wu 📂 Article 📅 2011 🏛 Springer Japan 🌐 English ⚖ 205 KB

Roman domination subdivision number of g

Roman domination subdivision number of graphs

✍ M. Atapour; S. M. Sheikholeslami; Abdollah Khodkar 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 268 KB

New Examples of Graphs without Small Cyc

New Examples of Graphs without Small Cycles and of Large Size

✍ Felix Lazebnik; Vasiliy A. Ustimenko 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 553 KB

Domination numbers of planar graphs

✍ MacGillivray, G.; Seyffarth, K. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 967 KB

The problem of determining the domination number of a graph is a well known NPhard problem, even when restricted to planar graphs. By adding a further restriction on the diameter of the graph, we prove that planar graphs with diameter two and three have bounded domination numbers. This implies that