A unified treatment of the most important results in the study of fractional graph concepts, this
volume explores the various ways in which integer-valued concepts can be modified to …

This paper surveys how the concept of crossing number, which used to be familiar only to a
limited group of specialists, emerges as a significant graph parameter. This paper has dual …

Let G be a simple connected graph with n vertices and m edges. Let δ (G)= δ be the
minimum degree of vertices of G. The spectral radius ρ (G) of G is the largest eigenvalue of …

A drawing of a graph G is a mapping which assigns to each vertex a point of the plane and
to each edge a simple continuous arc connecting the corresponding two points. The …

On the crossing numbers of products of cycles and graphs of order four Page 1 On the
Crossing Numbers of Products of Cycles and Graphs of Order Four Lowell W. Beineke Richard …

In a previous paper, Aigner and Fromme (Discrete Appl. Math. 8 (1984), 1–12) considered a
game played on a finite connected graph G where s pursuers try to catch one evader. They …

Given a finite, undirected, simple graph G, we are concerned with operations on G that
transform it into a planar graph. We give a survey of results about such operations and …

The crossing number of <i>K</i>_1,3,<i>n</i> and <i>K</i><sub>2, Page 1 The
Crossing Number of K1.3,n and K2.3.n Kouhei Asano FACULTY OF SCIENCE KWANSEI …

We give polynomial-time algorithms for the exact computation of lowest-energy states, worst
margin violators, partition functions, and marginals in certain binary undirected graphical …

Graphs can be represented in many di erent ways: by lists of edges, by incidence relations,
by adjacency matrices, and by other similar structures. These representations are well suited …