✦ LIBER ✦

Relationships between the class of unit grid intersection graphs and other classes of bipartite graphs

✍ Scribed by Yota Otachi; Yoshio Okamoto; Koichi Yamazaki

Book ID: 108112687
Publisher: Elsevier Science
Year: 2007
Tongue: English
Weight: 225 KB
Volume: 155
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2007.07.010

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The complexity of the matching-cut probl

The complexity of the matching-cut problem for planar graphs and other graph classes

✍ Paul Bonsma 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 247 KB

## Abstract The Matching‐Cut problem is the problem to decide whether a graph has an edge cut that is also a matching. Previously this problem was studied under the name of the Decomposable Graph Recognition problem, and proved to be ${\cal{NP}}$‐complete when restricted to graphs with maximum deg

[Lecture Notes in Computer Science] Grap

[Lecture Notes in Computer Science] Graph-Theoretic Concepts in Computer Science Volume 5911 || Counting the Number of Matchings in Chordal and Chordal Bipartite Graph Classes

✍ Paul, Christophe; Habib, Michel 📂 Article 📅 2010 🏛 Springer Berlin Heidelberg ⚖ 240 KB

The calcium dependent endonuclease activ

The calcium dependent endonuclease activity of isolated nuclear preparations. Relationships between its occurrence and the occurrence of other classes of enzymes found in nuclear preparations

✍ D.R. Hewish; L.A. Burgoyne 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 343 KB