𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On quadrilaterals in a graph

✍ Scribed by Bert Randerath; Ingo Schiermeyer; Hong Wang

Book ID
108316351
Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
105 KB
Volume
203
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Disjoint directed quadrilaterals in a di
Disjoint directed quadrilaterals in a directed graph
✍ Danhong Zhang; Hong Wang πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 139 KB

## Abstract Let __D__ be a directed graph of order 4__k__, where __k__ is a positive integer. Suppose that the minimum degree of __D__ is at least 6__k__β€‰βˆ’β€‰2. We show that __D__ contains __k__ disjoint directed quadrilaterals with only one exception. Β© 2005 Wiley Periodicals, Inc. J Graph Theory

A note on minimal order of a bipartite g
A note on minimal order of a bipartite graph with exactly q quadrilaterals
✍ Mariusz WoΕΊniak πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 206 KB

note on minimal order of a bipartite graph with exactly 4 quadrilaterals, Discrete Mathematics 121 (1993) 229-233. We show that the minimal order of a bipartite graph having exactly 4 quadrilaterals is asymptotically equal to 2fl $j (as 4 tends to infinity).

On extremal graphs without compatible tr
On extremal graphs without compatible triangles or quadrilaterals
✍ Olof Barr πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 679 KB

Letf(n, H, 5) be the maximal number of edges in a graph with n vertices not containing a subgraph H compatible with a transition system X in the family of transition systems !T. Here we will use a family of transition systems X,, defined through local edge colourings. At each vertex the edge set is