✦ LIBER ✦

Coding graphs by contractions

✍ Scribed by D. P. Geller

Publisher: John Wiley and Sons
Year: 1976
Tongue: English
Weight: 486 KB
Volume: 6
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.3230060103

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Contractions and hamiltonian line graphs

✍ Hong-Jian Lai 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 201 KB

Using the contraction method, we find a best possible condition involving the minimum degree for a triangle-free graph to have a spanning eulerian subgraph.

Finite Contractions of Graphs with Polyn

Finite Contractions of Graphs with Polynomial Growth

✍ András Lukács; Norbert Seifter 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 86 KB

Let X be a locally finite, vertex-transitive, infinite graph with polynomial growth. Then there exists a quotient group of Aut(X ) which contains a finitely generated nilpotent subgroup N which has the same growth rate as X . We show that X contains a subgraph which is finitely contractible onto the

Binary contraction of graphs

✍ Patrice Assouad 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 410 KB

We define the (elementary) binary contraction Gs of a graph G = (V, E) in the following way: if (S) is an induced K,,, not contained into an induced Klv3, then Gs is either the induced subgraph (V\ S), or the graph obtained from (V\S) by adding a new vertex adjacent to those x E V\S such that (S U(x

Contractible bonds in Graphs

✍ Sean McGuinness 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 157 KB

Topological code of graphs

✍ Cheng-Ho Hsu; Kin-Tak Lam 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 568 KB

Perfect codes in graphs

✍ Norman Biggs 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 396 KB