𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A condition for a hamiltonian bipartite graph to be bipancyclic

✍ Scribed by D. Amar

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
364 KB
Volume
102
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A sufficient condition for bipartite gra
A sufficient condition for bipartite graphs to be type one
✍ Xu, Baogang πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 58 KB πŸ‘ 2 views

The total chromatic number Ο‡ T (G) of graph G is the least number of colors assigned to V (G) βˆͺ E(G) such that no adjacent or incident elements receive the same color. In this article, we give a sufficient condition for a bipartite graph G to have Ο‡ T (G) = βˆ†(G) + 1.

Sufficient conditions for a digraph to b
Sufficient conditions for a digraph to be Hamiltonian
✍ Bang-Jensen, JοΏ½rgen; Gutin, Gregory; Li, Hao πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 412 KB πŸ‘ 2 views

We describe a new type of sufficient condition for a digraph to be Hamiltonian. Conditions of this type combine local structure of the digraph with conditions on the degrees of nonadjacent vertices. The main difference from earlier conditions is that we do not require a degree condition on all pairs