✦ LIBER ✦

New Examples of Graphs without Small Cycles and of Large Size

✍ Scribed by Felix Lazebnik; Vasiliy A. Ustimenko

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 553 KB
Volume: 14
Category: Article
ISSN: 0195-6698
DOI: 10.1006/eujc.1993.1048

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Domination Number of Graphs Without Smal

Domination Number of Graphs Without Small Cycles

✍ Xue-gang Chen; Moo Young Sohn 📂 Article 📅 2011 🏛 Springer Japan 🌐 English ⚖ 167 KB

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

New Constructions of Bipartite Graphs on

New Constructions of Bipartite Graphs on m, n Vertices with Many Edges and Without Small Cycles

✍ F. Lazebnik; V.A. Ustimenko; A.J. Woldar 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 293 KB

Choosability of toroidal graphs without

Choosability of toroidal graphs without short cycles

✍ Leizhen Cai; Weifan Wang; Xuding Zhu 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 142 KB 👁 1 views

## Abstract Let __G__ be a toroidal graph without cycles of a fixed length __k__, and χ~__l__~(__G__) the list chromatic number of __G__. We establish tight upper bounds of χ~__l__~(__G__) for the following values of __k__: © 2009 Wiley Periodicals, Inc. J Graph Theory 65: 1–15, 2010.