𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On Two-Graphs of Ovoids inO2n+ 1(q)

✍ Scribed by Athula Gunawardena

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
46 KB
Volume
18
Category
Article
ISSN
0195-6698

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Existence and Explicit Constructions of
Existence and Explicit Constructions of q + 1 Regular Ramanujan Graphs for Every Prime Power q
✍ M. Morgenstern πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 691 KB

For any prime power \(q\), we give explicit constructions for many infinite linear families of \(q+1\) regular Ramanujan graphs. This partially solves a problem that was raised by A. Lubotzky, R. Phillips, and P. Sarnak. They gave the same results as here, but only for \(q\) being prime and not equa

On two-factors of bipartite regular grap
On two-factors of bipartite regular graphs
✍ J.D. Horton πŸ“‚ Article πŸ“… 1982 πŸ› Elsevier Science 🌐 English βš– 654 KB

The set of two-factors of a bipartite k-regular graph, k > 2, spans the cycle space of the graph. In addition, a new non-hamiltonian T-connected bicubic graph on 92 vertices is constructed.

On the two-edge-colorings of perfect gra
On the two-edge-colorings of perfect graphs
✍ ChΓ­nh T. HoΓ ng πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 409 KB πŸ‘ 1 views

## Abstract We investigate the conjecture that a graph is perfect if it admits a two‐edge‐coloring such that two edges receive different colors if they are the nonincident edges of a __P__~4~ (chordless path with four vertices). Partial results on this conjecture are given in this paper. Β© 1995 Joh

On the perfect orderability of unions of
On the perfect orderability of unions of two graphs
✍ HoοΏ½ng, ChοΏ½nh T.; Tu, Xiaodan πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 264 KB πŸ‘ 3 views

A graph G is perfectly orderable, if it admits an order < on its vertices such that the sequential coloring algorithm delivers an optimum coloring on each induced subgraph (H, <) of (G, <). A graph is a threshold graph, if it contains no P 4 , 2K 2 , and C 4 as induced subgraph. A theorem of ChvΓ‘tal