✦ LIBER ✦

Relations between the set-complexity and the structure of graphs and their sub-graphs

✍ Scribed by Tomasz M Ignac, Nikita A Sakhanenko…

Book ID: 120924431
Publisher: BioMed Central
Year: 2012
Tongue: English
Weight: 285 KB
Volume: 2012
Category: Article
ISSN: 1687-4145
DOI: 10.1186/1687-4153-2012-13

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Structure of Well-Covered Graphs and

The Structure of Well-Covered Graphs and the Complexity of Their Recognition Problems

✍ David Tankus; Michael Tarsi 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 449 KB

A graph is well-covered if all its maximal independent sets are of the same cardinality. Deciding whether a given graph is well-covered is known to be NP-hard in general, and solvable in polynomial time, if the input is restricted to certain families of graphs. We present here a simple structural ch

On the Complexity of Recognizing Hamming

On the Complexity of Recognizing Hamming Graphs and Related Classes of Graphs

✍ Wilfried Imrich; Sandi Klavzar 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 287 KB

On the complexity of graphs and molecule

On the complexity of graphs and molecules

✍ Steven H. Bertz 📂 Article 📅 1983 🏛 Springer 🌐 English ⚖ 359 KB

On the complexity of graphs and molecule

On the complexity of graphs and molecules

✍ Steven H. Bertz 📂 Article 📅 1983 🏛 Springer 🌐 English ⚖ 373 KB

Entanglement and the complexity of direc

Entanglement and the complexity of directed graphs

✍ Berwanger, Dietmar; Grädel, Erich; Kaiser, Łukasz; Rabinovich, Roman 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 449 KB

The relation between the Jordan structur

The relation between the Jordan structure of a matrix and its graph

✍ Daniel Hershkowitz 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 900 KB