✦ LIBER ✦

Independent sets, cliques and hamiltonian graphs

✍ Scribed by Xin Liu

Publisher: Springer Japan
Year: 1995
Tongue: English
Weight: 471 KB
Volume: 11
Category: Article
ISSN: 0911-0119
DOI: 10.1007/bf01793014

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Partitioning chordal graphs into indepen

Partitioning chordal graphs into independent sets and cliques

✍ Pavol Hell; Sulamita Klein; Loana Tito Nogueira; Fábio Protti 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 217 KB

We consider the following generalization of split graphs: A graph is said to be a (k; ')-graph if its vertex set can be partitioned into k independent sets and ' cliques. (Split graphs are obtained by setting k = ' = 1.) Much of the appeal of split graphs is due to the fact that they are chordal, a

Clique polynomials and independent set p

Clique polynomials and independent set polynomials of graphs

✍ Cornelis Hoede; Xueliang Li 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 492 KB

This paper introduces two kinds of graph polynomials, clique polynomial and independent set polynomial. The paper focuses on expansions of these polynomials. Some open problems are mentioned.

Partitions of graphs into one or two ind

Partitions of graphs into one or two independent sets and cliques

✍ Andreas Brandstädt 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 417 KB

It is shown in this note that it can be recognized in polynomial time whether the vertex set of a finite undirected graph can be partitioned into one or two independent sets and one or two cliques. Such graphs generalize bipartite and split graphs and the result also shows that it can be recognized

Disjoint cliques and disjoint maximal in

Disjoint cliques and disjoint maximal independent sets of vertices in graphs

✍ Paul Erdös; Arthur M. Hobbs; C. Payan 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 548 KB

Another note on cliques and independent

Another note on cliques and independent sets

✍ Fred Galvin 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 50 KB 👁 2 views

A note on cliques and independent sets

✍ Entringer, Roger C.; Goddard, Wayne; Henning, Michael A. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 58 KB 👁 2 views

For integers m, n ≥ 2, let f (m, n) be the minimum order of a graph where every vertex belongs to both a clique of cardinality m and an independent set of cardinality n. We show that f (m, n) = ( √ m -1 + √ n -1) 2 .