✦ LIBER ✦

0-Dual Closures for Several Classes of Graphs

✍ Scribed by Ahmed Ainouche; Ingo Schiermeyer

Book ID: 106047467
Publisher: Springer Japan
Year: 2003
Tongue: English
Weight: 323 KB
Volume: 19
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-002-0523-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Computation of the 0-dual closure for ha

Computation of the 0-dual closure for hamiltonian graphs

✍ Ingo Schiermeyer 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 601 KB

Schiermeyer, I., Computation of the O-dual closure for hamiltonian graphs, Discrete Mathematics 111 (1993) 455-464. The well-known closure concept of Bondy and Chvbtal (1976) is based on degree sums of pairs of nonadjacent vertices. It generalizes six earlier sufficient degree conditions for hamilto

Stability of Hereditary Graph Classes Un

Stability of Hereditary Graph Classes Under Closure Operations

✍ Mirka Miller; Joe Ryan; Zdeněk Ryjáček; Jakub Teska; Petr Vrána 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 999 KB

Forbidden graphs for classes of split-li

Forbidden graphs for classes of split-like graphs

✍ Drgas-Burchardt, Ewa 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 450 KB

Isochronicity for Several Classes of Ham

Isochronicity for Several Classes of Hamiltonian Systems

✍ A. Cima; F. Mañosas; J. Villadelprat 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 314 KB

Genus distributions for two classes of g

Genus distributions for two classes of graphs

✍ Merrick L Furst; Jonathan L Gross; Richard Statman 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 663 KB

Subdivision thresholds for two classes o

Subdivision thresholds for two classes of graphs

✍ C.A. Barefoot; L.H. Clark; A.J. Depew; R.C. Entringer; L.A. Székely 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 902 KB

The subdivision threshold for a graph F is the maximum number of edges, ex(n; FS), a graph of order n can have without containing a subdivision of F as a subgraph. We consider two instances: (i) F is the graph formed by a cycle C one vertex of which is adjacent to k vertices not on C, and (ii) F is