✦ LIBER ✦

A sufficient condition for certain semigroups to be free

✍ Scribed by David A Klarner

Publisher: Elsevier Science
Year: 1982
Tongue: English
Weight: 450 KB
Volume: 74
Category: Article
ISSN: 0021-8693
DOI: 10.1016/0021-8693(82)90010-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A sufficient condition for oriented grap

A sufficient condition for oriented graphs to be Hamiltonian

✍ Odile Favaron; Oscar Ordaz 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 492 KB

A sufficient condition for a digraph to

A sufficient condition for a digraph to be kernel-perfect

✍ P. Duchet 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 205 KB

A sufficient condition for a matrix to b

A sufficient condition for a matrix to be totally unimodular

✍ F. G. Commoner 📂 Article 📅 1973 🏛 John Wiley and Sons 🌐 English ⚖ 620 KB

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

Sufficient conditions for a graph to be

Sufficient conditions for a graph to be Hamiltonian

✍ S Goodman; S Hedetniemi 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 330 KB

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.