✦ LIBER ✦

Polyhedron of triangle-free simple 2-matchings in subcubic graphs

✍ Scribed by David Hartvigsen,Yanjun Li

Book ID: 126348060
Publisher: Springer-Verlag
Year: 2012
Tongue: English
Weight: 964 KB
Volume: 138
Category: Article
ISSN: 0025-5610
DOI: 10.1007/s10107-012-0516-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Maximum Cardinality Simple 2-matchings i

Maximum Cardinality Simple 2-matchings in Subcubic Graphs

✍ Hartvigsen, David; Li, Yanjun 📂 Article 📅 2011 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 388 KB

A simple algorithm for finding a maximum

A simple algorithm for finding a maximum triangle-free -matching in subcubic graphs

✍ Yusuke Kobayashi 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 331 KB

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