✦ LIBER ✦

Labelings of Graphs with Fixed and Variable Edge-Weights

✍ Scribed by Babilon, Robert; Jelínek, Vít; Král', Daniel; Valtr, Pavel

Book ID: 118196886
Publisher: Society for Industrial and Applied Mathematics
Year: 2007
Tongue: English
Weight: 347 KB
Volume: 21
Category: Article
ISSN: 0895-4801
DOI: 10.1137/040619545

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Optimization on Graphs with Variable-Wei

Optimization on Graphs with Variable-Weight Edges

✍ A. I. Ermolaev 📂 Article 📅 2002 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 112 KB

Super–edge–graceful Labelings of Some Cu

Super–edge–graceful Labelings of Some Cubic Graphs

✍ Wai Chee Shiu 📂 Article 📅 2006 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 190 KB

Fixed-edge theorem for graphs with loops

✍ Richard Nowakowski; Ivan Rival 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 521 KB

## Abstract Let __G__ be an undirected graph without multiple edges and with a loop at every vertex—the set of edges of __G__ corresponds to a reflexive and symmetric binary relation on its set of vertices. Then __every edge‐preserving map of the set of vertices of G to itself fixes an edge__ [{__f

Codings of graphs with binary edge label

Codings of graphs with binary edge labels

✍ Martin Aigner; Eberhard Triesch 📂 Article 📅 1994 🏛 Springer Japan 🌐 English ⚖ 424 KB

Hamiltonian weights and unique 3-edge-co

Hamiltonian weights and unique 3-edge-colorings of cubic graphs

✍ Cun-Quan Zhang 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 402 KB

## Abstract A (1,2)‐eulerian weight __w__ of a grph is hamiltonian if every faithful cover of __w__ is a set of two Hamilton circuits. Let __G__ be a 3‐connected cubic graph containing no subdivition of the Petersen graph. We prove that if __G__ admits a hamiltonian weight then __G__ is uniquely 3‐

The maximum number of edges in a graph w

The maximum number of edges in a graph with fixed edge-degree

✍ R.J. Faudree; J. Sheehan 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 633 KB

Suppose that n i> 2t + 2 (t/> 17). Let G be a graph with n vertices such that its complement is connected and, for all distinct non-adjacent vertices u and v, there are at least t common neighbours. Then we prove that and Furthermore, the results are sharp.