✦ LIBER ✦

3-minimal triangle-free graphs

✍ Scribed by Alzohairi, Mohammad; Boudabbous, Youssef

Book ID: 122245686
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 393 KB
Volume: 331
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2014.04.020

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On minimal 5-chromatic triangle-free gra

On minimal 5-chromatic triangle-free graphs

✍ David Avis 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 139 KB 👁 1 views

## Abstract It is shown that the minimum number of vertices in a triangle‐free 5‐chromatic graph is at least 19.

Size in maximal triangle-free graphs and

Size in maximal triangle-free graphs and minimal graphs of diameter 2

✍ Curtiss Barefoot; Karen Casey; David Fisher; Kathryn Fraughnaugh; Frank Harary 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 290 KB

A triangle-free graph is maximal if the addition of any edge creates a triangle. For n ~> 5, we show there is an n-node m-edge maximal triangle-free graph if and only if it is complete bipartite or 2n-5<<.m<<.L(n-1)2/4J+l. A diameter 2 graph is minimal if the deletion of any edge increases the diame

On-Line 3-Chromatic Graphs I. Triangle-F

On-Line 3-Chromatic Graphs I. Triangle-Free Graphs

✍ Gyárfás, András; Király, Zoltán; Lehel, Jeno 📂 Article 📅 1999 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 460 KB

On minimal triangle-free graphs with pre

On minimal triangle-free graphs with prescribed -defective chromatic number

✍ Nirmala Achuthan; N.R. Achuthan; M. Simanihuruk 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 516 KB

Fast 3-coloring Triangle-Free Planar Gra

Fast 3-coloring Triangle-Free Planar Graphs

✍ Lukasz Kowalik 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 546 KB

Triangle-free regular graphs

✍ A.F. Sidorenko 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 152 KB