✦ LIBER ✦

Characterizations of maximum fractional -factors of graphs

✍ Scribed by Guizhen Liu; Lanju Zhang

Book ID: 108112722
Publisher: Elsevier Science
Year: 2008
Tongue: English
Weight: 221 KB
Volume: 156
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2007.10.016

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Maximum fractional factors in graphs

✍ Guizhen Liu; Qinglin Yu; Lanju Zhang 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 247 KB

Characterizations of maximum matching gr

Characterizations of maximum matching graphs of certain types

✍ Yan Liu 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 172 KB

Characterization of maximum critically 2

Characterization of maximum critically 2-connected graphs

✍ R. C. Entringer 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 346 KB

## Abstract A graph __G__ is critically 2‐connected if __G__ is 2‐connected but, for any point __p__ of __G, G — p__ is not 2‐connected. Critically 2‐connected graphs on __n__ points that have the maximum number of lines are characterized and shown to be unique for __n__ ⩾ 3, __n__ ≠ 11.

Characterizations of -copwin graphs

✍ Nancy E. Clarke; Gary MacGillivray 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 197 KB

Characterizations of outerplanar graphs

✍ Maciej M. Sysło 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 750 KB 👁 1 views

The paper presents several characterizations of outerp:anar graphs, some of them are counterparts of the well-known characterizations of planar graphs and the other provide very efficient tools for outerplanarity testing, coding (i.e. isomorphism testing), and counting such graphs. Finally, we attem

Characterizations of signed graphs

✍ Thomas Zaslavsky 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 271 KB

## Abstract The possible classes of balanced circles of a signed graph are characterized in two ways.