✦ LIBER ✦

On Number of Circles Intersected by a Line

✍ Scribed by Lu Yang; Jingzhong Zhang; Weinian Zhang

Publisher: Elsevier Science
Year: 2002
Tongue: English
Weight: 394 KB
Volume: 98
Category: Article
ISSN: 0097-3165
DOI: 10.1006/jcta.2001.3243

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On Pairs of Lattice Paths with a Given N

On Pairs of Lattice Paths with a Given Number of Intersections

✍ Markus Fulmek 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 307 KB

This formula was proved in [2] by means of generating functions. ## 2. INTERPRETATION OF THE FORMULA'S SUMMANDS Our bijection is based on an appropriate lattice-path-interpretation for the formula's summands (pointed out by Krattenthaler [4]): Clearly, we article no. TA962754 154 0097-3165Â97 25.0

Method of line drawing recognition based

Method of line drawing recognition based on intersection model

✍ Akira Maeda; Koji Wakimoto; Hiroto Nagahisa 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 891 KB

Some Remarks on Second-Order-Analysis of

Some Remarks on Second-Order-Analysis of Planar Fibre Processes by Line Intersections

✍ L. Heinrich; A. Schwandtke 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 493 KB 👁 1 views

The problem of the sighting line stabili

The problem of the sighting line stabilization for axial meridian circles

✍ P. F. Lazorenko; A. V. Sergeev 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 523 KB

The paper deals with the method based on treating the axial meridian circle and a long-focus light mark in the prime vertical as a single virtual instrument that has properties of meridian circle. A horizontal axis, a sighting line, and a micrometer cross-wire of the instrument are created by optica

Is There a Circle that Passes Through a

Is There a Circle that Passes Through a Given Number of Lattice Points?

✍ H. Maehara; M. Matsumoto 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 45 KB

A note on the line-distinguishing chroma

A note on the line-distinguishing chromatic number and the chromatic index of a graph

✍ N. Zagaglia Salvi 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 126 KB 👁 1 views

## Abstract Let λ(__G__) be the line‐distinguishing chromatic number and __x__′(__G__) the chromatic index of a graph __G__. We prove the relation λ(__G__) ≥ __x__′(__G__), conjectured by Harary and Plantholt. © 1993 John Wiley & Sons, Inc.