✦ LIBER ✦

The Space of Maximal Complete Subgraphs of a Graph

✍ Scribed by LOUIS M. FRIEDLER; HAROLD W. MARTIN

Book ID: 119872630
Publisher: John Wiley and Sons
Year: 1995
Tongue: English
Weight: 536 KB
Volume: 767
Category: Article
ISSN: 0890-6564
DOI: 10.1111/j.1749-6632.1995.tb55894.x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Compact Spaces and Spaces of Maximal Com

Compact Spaces and Spaces of Maximal Complete Subgraphs

✍ Murray Bell and John Ginsburg 📂 Article 📅 1984 🏛 American Mathematical Society 🌐 English ⚖ 283 KB

On the number of maximal bipartite subgr

On the number of maximal bipartite subgraphs of a graph

✍ Jesper Makholm Byskov; Bolette Ammitzbøll Madsen; Bjarke Skjernaa 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 72 KB 👁 2 views

We show new lower and upper bounds on the maximum number of maximal induced bipartite subgraphs of graphs with n vertices. We present an infinite family of graphs having 105 n=10 % 1:5926 n ; such subgraphs show an upper bound of O(12 n=4 ) ¼ O(1:8613 n ) and give an algorithm that finds all maximal

Maximal chains of isomorphic subgraphs o

Maximal chains of isomorphic subgraphs of the Rado graph

✍ Kurilić, Miloš S.; Kuzeljević, Boriša 📂 Article 📅 2013 🏛 Akadmiai Kiad 🌐 English ⚖ 512 KB

On the decomposition of a complete graph

On the decomposition of a complete graph into planar subgraphs

✍ Isao Shirakawa; Hiromitsu Takahashi; Hiroshi Ozaki 📂 Article 📅 1967 🏛 Elsevier Science 🌐 English ⚖ 692 KB

Partitioning a graph into the minimal nu

Partitioning a graph into the minimal number of complete subgraphs

✍ A. P. Ryzhkov 📂 Article 📅 1976 🏛 Springer US 🌐 English ⚖ 557 KB

Complete subgraphs of the graphs of conv

Complete subgraphs of the graphs of convex polytopes

✍ S. Gallivan; E.R. Lockeberg; P. McMullen 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 631 KB

It is shown that if three vertices of the graph c?(l)) of a convex 3-polytope P are chosen, then G(P) contains a refinement of the complete graph C,, on four vertices, for which the three chosen vertices are principal (that is, correspond to vertices of C, in the refinement.. In general, all four ve