✦ LIBER ✦

Some problems between a w-graph and its derived graphs

✍ Scribed by Hua-An Zhao; Wataru Mayeda

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 793 KB
Volume: 330
Category: Article
ISSN: 0016-0032
DOI: 10.1016/0016-0032(93)90010-r

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Some relations between rank of a graph a

Some relations between rank of a graph and its complement

✍ Saieed Akbari; Alireza Alipour; Javad Ebrahimi Boroojeni; Ebrahim Ghorbani; Mirh 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 136 KB

A result onk-valent graphs and its appli

A result onk-valent graphs and its application to a graph embedding problem

✍ Paul E. Dunne 📂 Article 📅 1987 🏛 Springer-Verlag 🌐 English ⚖ 476 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

A connection between a convex programmin

A connection between a convex programming problem and the LYM property on perfect graphs

✍ Victor K. Wei 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 772 KB

We derive three equivalent conditions on a perfect graph concerning the optimal solution of a convex programming problem, the length-width inequality, and the simultaneous vertex covering by cliques and anticliques. By combining proof techniques including Lagrangian dual, Dilworth's Theorem, and Kuh

A method of matrix analysis and its appl

A method of matrix analysis and its application to a problem in the theory of graphs

✍ I.Kh. Sigal; V.A. Chebakov 📂 Article 📅 1965 🏛 Elsevier Science ⚖ 206 KB

The gap between the chromatic number of

The gap between the chromatic number of a graph and the rank of its adjacency matrix is superlinear

✍ A.A. Razborov 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 199 KB

The gap between the chromatic number of a graph and the rank of its adjacency matrix is superlinear.