✦ LIBER ✦

Maximum graphs with a unique k-factor

✍ Scribed by G.R.T Hendry

Book ID: 107884203
Publisher: Elsevier Science
Year: 1984
Tongue: English
Weight: 563 KB
Volume: 37
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(84)90044-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the structure of graphs with a unique

On the structure of graphs with a unique k-factor

✍ Petra Johann 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 207 KB 👁 2 views

On the structure of graphs with a unique

On the structure of graphs with a unique k-factor

✍ Petra Johann 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 205 KB

Graphs with unique maximum independent s

Graphs with unique maximum independent sets

✍ Glenn Hopkins; William Staton 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 402 KB

On unique k-factors and unique [1,k]-fac

On unique k-factors and unique [1,k]-factors in graphs

✍ Arne Hoffmann; Lutz Volkmann 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 234 KB

A census of maximum uniquely hamiltonian

A census of maximum uniquely hamiltonian graphs

✍ Curtiss A. Barefoot; R. C. Entringer 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 261 KB 👁 1 views

## Abstract We show that there are 2^[n/2]‐4^ largest graphs of order __n__ ≥ 7 having exactly one hamiltonian cycle. a recursive procedure for constructing these graphs is described.

Graphs with unique minimum edge dominati

Graphs with unique minimum edge dominating sets and graphs with unique maximum independent sets of vertices

✍ Jerzy Topp 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 816 KB

Topp, J., Graphs with unique minimum edge dominating sets and graphs with unique maximum independent sets of vertices, Discrete Mathematics 12 1 (1993) 199-210. A set I of vertices of a graph G is an independent set if no two vertices of I are adjacent. A set M of edges of G is an edge dominating s