Search Results for ""

Assignment of each graph edge of a graph to one of two color classes (commonly designation "red" and "green").

The intersection number omega(G) of a given graph G is the minimum number of elements in a set S such that G is an intersection graph on S.

A graph G is said to be separable if it is either disconnected or can be disconnected by removing one vertex, called articulation. A graph that is not separable is said to be ...

The Sims graph is a distance-transitive graph on 352 vertices (Brouwer et al. 1989, p. 370).

A straight line embedding, or "straight line drawing," of a graph is a graph embedding in which all edges are drawn as straight line segments (as opposed to curves, etc.).

A 3-coloring of graph edges so that no two edges of the same color meet at a graph vertex (Ball and Coxeter 1987, pp. 265-266).

Wagner's theorem states that a graph is planar iff it does not contain K_5 or K_(3,3) as a graph minor.

The Wormald graph is a unit-distance 4-chromatic graph with girth 5 on 13+5(13; 5)=6448 vertices.

A chordless graph is a simple graph possessing no chords. A chordal graph (which possesses no chordless cycles) is not the same as (or converse of) a chordless graph (which ...

A polyhedral graph is completely regular if the dual graph is also regular. There are only five types. Let rho be the number of graph edges at each node, rho^* the number of ...