✦ LIBER ✦

A characterization of lines among Lipschitz graphs

✍ Scribed by Lucien Chevalier; Jean-Pierre Rosay

Book ID: 105201231
Publisher: Springer
Year: 1996
Tongue: English
Weight: 194 KB
Volume: 304
Category: Article
ISSN: 0025-5831
DOI: 10.1007/bf01446305

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A characterization of line graphs that a

A characterization of line graphs that are squares of graphs

✍ Milanič, Martin; Oversberg, Andrea; Schaudt, Oliver 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 396 KB

A characterization of partial directed l

A characterization of partial directed line graphs

✍ Nicola Apollonio; Paolo G. Franciosa 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 304 KB

Characterizations of second iterated lin

Characterizations of second iterated line graphs

✍ Zhao Guangfu 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 477 KB

A Characterization of Planar Graphs by P

A Characterization of Planar Graphs by Pseudo-Line Arrangements

✍ Hisao and Takeshi 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 279 KB

A characterization of 1-cycle resonant g

A characterization of 1-cycle resonant graphs among bipartite 2-connected plane graphs

✍ Sandi Klavžar; Khaled Salem 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 190 KB

Polyhedral characterizations and perfect

Polyhedral characterizations and perfection of line graphs

✍ Dasong Cao; George L. Nemhauser 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 929 KB

We give a polyhedral characterization of line graphs that. in some sense, gives a converse to Edmonds' matching theorem. We also study perfect, t-perfect and h-perfect line graphs and give polyhedral and structural characterizations. We identify a class of h-perfect graphs that are neither perfect