✦ LIBER ✦

An exact lower bound on the number of cut-sets in multigraphs

✍ Scribed by Hideaki Harada; Zheng Sun; Hiroshi Nagamochi

Publisher: John Wiley and Sons
Year: 1994
Tongue: English
Weight: 903 KB
Volume: 24
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.3230240804

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Lower bounds on the number of triangles

Lower bounds on the number of triangles in a graph

✍ David C. Fisher 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 294 KB 👁 1 views

Lower bounds on the independence number

Lower bounds on the independence number in terms of the degrees

✍ Jerrold R Griggs 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 872 KB

An upper bound on the number of cuts nee

An upper bound on the number of cuts needed in Gomory's method of integer forms

✍ Francis J. Nourie; Enrique R. Venta 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 270 KB

Lower bounds on the stability number of

Lower bounds on the stability number of graphs computed in terms of degrees

✍ Owen Murphy 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 246 KB

An upper bound on the number of cliques

An upper bound on the number of cliques in a graph

✍ Martin Farber; Mihály Hujter; Zsolt Tuza 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 252 KB 👁 1 views

The performance of an eigenvalue bound o

The performance of an eigenvalue bound on the max-cut problem in some classes of graphs

✍ C. Delorme; S. Poljak 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 683 KB

Delorme, C. and S. Poljak, The performance of an eigenvalue bound on the max-cut problem in some classes of graphs, Discrete Mathematics 111 (1993) 145-156. The authors earlier introduced a number q(C), which gives a well-computable upper bound on the maximum bipartite subgraph of a graph or, more