𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the size of identifying codes in triangle-free graphs

✍ Scribed by Florent Foucaud; Ralf Klasing; Adrian Kosowski; André Raspaud

Book ID
113564795
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
308 KB
Volume
160
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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 the Hull Number of Triangle-Free Grap
On the Hull Number of Triangle-Free Graphs
✍ Dourado, Mitre C.; Protti, Fábio; Rautenbach, Dieter; Szwarcfiter, Jayme L. 📂 Article 📅 2010 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 221 KB
On the asymptotic structure of sparse tr
On the asymptotic structure of sparse triangle free graphs
✍ Pr�mel, Hans J�rgen; Steger, Angelika 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 567 KB

An important result of Erdos, Kleitman, and Rothschild says that almost every triangle-free graph on n vertices has chromatic number 2. In this paper w e study the asymptotic structure of graphs in y0rb,,,(K3), i.e., in the class of trianglefree graphs on n vertices having rn = rn(n) edges. In parti