✦ LIBER ✦

On the number of graphs without 4-cycles

✍ Scribed by Daniel J. Kleitman; Kenneth J. Winston

Book ID: 107748417
Publisher: Elsevier Science
Year: 1982
Tongue: English
Weight: 534 KB
Volume: 41
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(82)90204-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On total chromatic number of planar grap

On total chromatic number of planar graphs without 4-cycles

✍ Ying-qian Wang; Min-le Shangguan; Qiao Li 📂 Article 📅 2007 🏛 SP Science China Press 🌐 English ⚖ 166 KB

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

The 4-Choosability of Plane Graphs witho

The 4-Choosability of Plane Graphs without 4-Cycles

✍ Peter Che Bor Lam; Baogang Xu; Jiazhuang Liu 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 179 KB

A graph G is called k-choosable if k is a number such that if we give lists of k colors to each vertex of G there is a vertex coloring of G where each vertex receives a color from its own list no matter what the lists are. In this paper, it is shown that each plane graph without 4-cycles is 4-choosa

On 4-connected graphs without even cycle

On 4-connected graphs without even cycle decompositions

✍ Romeo Rizzi 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 90 KB

The number of 4-cycles in triangle-free

The number of 4-cycles in triangle-free oriented graphs

✍ Shinsei Tazawa; Chiê Nara; John W. Moon 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 290 KB

On the structure of complete graphs with

On the structure of complete graphs without alternating cycles

✍ C.C. Chen 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 139 KB