✦ LIBER ✦

Graphs omitting a finite set of cycles

✍ Scribed by Cherlin, Gregory; Shi, Niandong

Publisher: John Wiley and Sons
Year: 1996
Tongue: English
Weight: 300 KB
Volume: 21
Category: Article
ISSN: 0364-9024
DOI: 10.1002/(sici)1097-0118(199603)21:3<351::aid-jgt11>3.0.co;2-k

No coin nor oath required. For personal study only.

✦ Synopsis

We prove that for C a finite set of cycles, there is a universal C-free graph if and only if C consists precisely of all the odd cycles of order less than same specified bound.

📜 SIMILAR VOLUMES

On the cycle polytope of a directed grap

On the cycle polytope of a directed graph

✍ Egon Balas; Maarten Oosten 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 185 KB 👁 1 views

Finite-time thermodynamic performance of

Finite-time thermodynamic performance of a Dual cycle

✍ Junxing Lin; Lingen Chen; Chih Wu; Fengrui Sun 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 110 KB

Finite-time thermodynamic analysis of an air-standard internal-combustion Dual cycle is performed in this paper. The relation between net work output and e$ciency of the cycle is derived. The maximum net work output and the corresponding e$ciency limit of the cycle with heat transfer considerations

Hamilton cycles in block-intersection gr

Hamilton cycles in block-intersection graphs of triple systems

✍ Peter Horák; David A. Pike; Michael E Raines 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 336 KB 👁 2 views

Given a BIBD S = (V, B), its 1-block-intersection graph GS has as vertices the elements of B; two vertices B1, B2 ∈ B are adjacent in GS if |B1 ∩ B2| = 1. If S is a triple system of arbitrary index λ, it is shown that GS is hamiltonian.

Proof of a conjecture on cycles in a bip

Proof of a conjecture on cycles in a bipartite graph

✍ Wang, Hong 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 244 KB 👁 2 views

It was conjectured in [Wang, to appear in The Australasian Journal of Combinatorics] that, for each integer k ≥ 2, there exists . This conjecture is also verified for k = 2, 3 in [Wang, to appear; Wang, manuscript]. In this article, we prove this conjecture to be true if n ≥ 3k, i.e., M (k) ≤ 3k. W

A matrix method for location of cycles o

A matrix method for location of cycles of a directed graph

✍ R. L. Norman 📂 Article 📅 1965 🏛 American Institute of Chemical Engineers 🌐 English ⚖ 269 KB

A graph-theoretic version of the union-c

A graph-theoretic version of the union-closed sets conjecture

✍ El-Zahar, Mohamed H. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 128 KB 👁 1 views

An induced subgraph S of a graph G is called a derived subgraph of G if S contains no isolated vertices. An edge e of G is said to be residual if e occurs in more than half of the derived subgraphs of G. We introduce the conjecture: Every non-empty graph contains a non-residual edge. This conjecture