𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A simple upper bound for the hamiltonian index of a graph

✍ Scribed by Marko Lovrečič Saražin

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
466 KB
Volume
134
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An upper bound on the length of a Hamilt
An upper bound on the length of a Hamiltonian walk of a maximal planar graph
✍ Takao Asano; Takao Nishizeki; Takahiro Watanabe 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 840 KB

## Abstract A Hamiltonian walk of a connected graph is a shortest closed walk that passes through every vertex at least once, and the length of a Hamiltonian walk is the total number of edges traversed by the walk. We show that every maximal planar graph with __p__(≥ 3) vertices has a Hamiltonian c

A bound for the complexity of a simple g
A bound for the complexity of a simple graph
✍ Robert Grone; Russell Merris 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 310 KB

Let G be a simple (nonfat graph wiih degree sequeme dl, dz, l . . , d,. The ~~~~~ of spanning trees of G is bounded above by

An upper bound for the path number of a
An upper bound for the path number of a graph
✍ Alan Donald 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 529 KB

## Abstract The path number of a graph __G__, denoted __p(G)__, is the minimum number of edge‐disjoint paths covering the edges of __G.__ Lovász has proved that if __G__ has __u__ odd vertices and __g__ even vertices, then __p(G)__ ≤ 1/2 __u__ + __g__ ‐ 1 ≤ __n__ ‐ 1, where __n__ is the total numbe

An upper bound for the harmonious chroma
An upper bound for the harmonious chromatic number of a graph
✍ Sin-Min Lee; John Mitchem 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 149 KB 👁 2 views

An upper bound for the harmonious chromatic number of a graph G is given. Three corollaries of the theorem are theorems or improvements of the theorems of Miller and Pritikin. The assignment of colors to the vertices of a graph such that each vertex has exactly one color has been studied for well o