Search Results for ""

The coarseness xi(G) of a graph G is the maximum number of edge-disjoint nonplanar subgraphs contained in a given graph G. The coarseness of a planar graph G is therefore ...

An independent vertex set of a graph G is a subset of the vertices such that no two vertices in the subset represent an edge of G. The figure above shows independent sets ...

An edge coloring of a graph G is a coloring of the edges of G such that adjacent edges (or the edges bounding different regions) receive different colors. An edge coloring ...

A minimum vertex cut of a graph is a vertex cut of smallest possible size. A vertex cut set of size 1 in a connected graph corresponds to an articulation vertex. The size of ...

The tritetrahedral graph is the skeleton of the tritetrahedron, a concave polyhedron formed by joining three regular tetrahedra at their faces. The Nechushtan graph, a ...

Graphs corresponding to closed walks of length k are known as k-cyclic graphs, or C_k-graphs for short. C_k-graphs are connected by definition. The numbers of C_k-graphs for ...

The detour polynomial of a graph G is the characteristic polynomial of the detour matrix of G. Precomputed detour polynomials for many named graphs are available in the ...

A canonical labeling, also called a canonical form, of a graph G is a graph G^' which is isomorphic to G and which represents the whole isomorphism class of G (Piperno 2011). ...

The smallest cubic graphs with graph crossing number CN(G)=n have been termed "crossing number graphs" or n-crossing graphs by Pegg and Exoo (2009). The n-crossing graphs are ...

The term "(a,b)-leaper" (sometimes explicitly called a "single-pattern leaper") describes a fairy chess piece such as a knight that may make moves which simultaneously change ...