✦ LIBER ✦

Almost Perfect Matrices and Graphs

✍ Scribed by Manfred Padberg

Book ID: 111985065
Publisher: INFORMS
Year: 2001
Tongue: English
Weight: 699 KB
Volume: 26
Category: Article
ISSN: 0364-765X
DOI: 10.2307/3690431

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Perfectly orderable graphs and almost al

Perfectly orderable graphs and almost all perfect graphs are kernelM-solvable

✍ Mostafa Blidia; Konrad Engel 📂 Article 📅 1992 🏛 Springer Japan 🌐 English ⚖ 273 KB

Critical perfect graphs and perfect 3-ch

Critical perfect graphs and perfect 3-chromatic graphs

✍ Alan Tucker 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 394 KB

Smallest close to regular bipartite grap

Smallest close to regular bipartite graphs without an almost perfect matching

✍ Lutz Volkmann; Axel Zingsem 📂 Article 📅 2010 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 186 KB

A generalization of perfect graphs?i-per

A generalization of perfect graphs?i-perfect graphs

✍ Cai, Leizhen; Corneil, Derek 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 1003 KB

Let i be a positive integer. We generalize the chromatic number x ( G ) of G and the clique number w(G) of G as follows: The i-chromatic number of G , denoted by x Z ( G ) , is the least number k for which G has a vertex partition V,, V,, . . . , Vk: such that the clique number of the subgraph induc

Matching-perfect and cover-perfect graph

Matching-perfect and cover-perfect graphs

✍ Mordechai Lewin 📂 Article 📅 1974 🏛 The Hebrew University Magnes Press 🌐 English ⚖ 125 KB

Almost Commutative Matrices

✍ Edmond Dale Dixon and John B. Daley 📂 Article 📅 1994 🏛 The Royal Society 🌐 English ⚖ 132 KB