𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Disjunctive extensions of S4 and a conjecture of Goldblatt's

✍ Scribed by George F. Schumm


Publisher
John Wiley and Sons
Year
1975
Tongue
English
Weight
365 KB
Volume
21
Category
Article
ISSN
0044-3050

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


A note on possible extensions of Negami'
✍ Hlin?nοΏ½, Petr πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 239 KB πŸ‘ 2 views

A graph H is a cover of a graph G, if there exists a mapping Ο• from V (H) onto V (G) such that for every vertex v of G, Ο• maps the neighbors of v in H bijectively onto the neighbors of Ο•(v) in G. Negami conjectured in 1987 that a connected graph has a finite planar cover if and only if it embeds in

On Extensions of a Conjecture of Gallai
✍ AndrΓ© E. KΓ©zdy; Hunter S. Snevily πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 307 KB

A graph G is k-critical if it has chromatic number k but every proper subgraph of G has a (k&1)-coloring. We prove the following result. If G is a k-critical graph of order n>k 3, then G contains fewer than n&3kΓ‚5+2 complete subgraphs of order k&1.

Equivalence of Fleischner's and Thomasse
✍ Martin Kochol πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 96 KB

We show that conjectures of Thomassen (every 4-connected line graph is hamiltonian) and Fleischner (every cyclically 4-edge-connected cubic graph has either a 3-edge-coloring or a dominating cycle) are equivalent.

A Simple Proof of an Aomoto-Type Extensi
✍ Kevin W.J. Kadell πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 162 KB

We establish an Aomoto-type extension of Askey's last conjectured Selberg q-integral, which was recently proved by Evans. We follow the lines of our proofs of Aomoto-type extensions of the Morris constant term q-identity and Gustafson's Askey-Wilson Selberg q-integral. We require integral forms of t

A short proof of a theorem of dirac's ab
✍ D. R. Woodall πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 105 KB πŸ‘ 1 views

## Abstract A Short proof is given of the theorem that every grph that does not have __K__~4~ as a subcontraction is properly vertex 3‐colorable.