✦ LIBER ✦

The binding number of a graph and its triangle

✍ Scribed by Shi Ronghua

Book ID: 112586180
Publisher: Institute of Applied Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year: 1985
Tongue: English
Weight: 458 KB
Volume: 2
Category: Article
ISSN: 0168-9673
DOI: 10.1007/bf01666521

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The binding number of a graph and its ci

The binding number of a graph and its circuits

✍ Shi Ronghua 📂 Article 📅 1985 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 385 KB

The binding number of a graph and its pa

The binding number of a graph and its pancyclism

✍ Ronghua Shi 📂 Article 📅 1987 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 927 KB

The binding number of a graph and its cl

The binding number of a graph and its cliques

✍ Jeremy Lyle; Wayne Goddard 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 364 KB

Determining the interval number of a tri

Determining the interval number of a triangle-free graph

✍ C. Maas 📂 Article 📅 1983 🏛 Springer Vienna 🌐 English ⚖ 386 KB

Competition numbers of graphs with a sma

Competition numbers of graphs with a small number of triangles

✍ Suh-Ryung Kim; Fred S. Roberts 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 722 KB

If D is an acyclic digraph, its competition graph is an undirected graph with the same vertex set and an edge between vertices x and y if there is a vertex a so that (x, a) and (y, a) are both arcs of D. If G is any graph, G together with sufficiently many isolated vertices is a competition graph, a

Computing the binding number of a graph

✍ William H. Cunningham 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 189 KB