𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An Ore-type sufficient condition for a bipancyclic ordering

✍ Scribed by George R.T. Hendry

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

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An Ore-type Condition for Cyclability
An Ore-type Condition for Cyclability
✍ Yaojun Chen; Yunqing Zhang; Kemin Zhang πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 98 KB

A graph G is said to be cyclable if for each orientation D of G, there exists a set S(D) βŠ† V (G) such that reversing all the arcs with one end in S results in a Hamiltonian digraph. Let G be a simple graph of even order n β‰₯ 8. In this paper, we show that if the degree sum of any two nonadjacent vert

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.

An improvement of fraisse's sufficient c
An improvement of fraisse's sufficient condition for hamiltonian graphs
✍ A. Ainouche πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 567 KB

## Abstract Let __G__ be a __k__‐connected graph of order __n__. For an independent set c, let __d(S)__ be the number of vertices adjacent to at least one vertex of __S__ and > let i(S) be the number of vertices adjacent to at least |S| vertices of __S__. We prove that if there exists some s, 1 ≀ s