Search Results for ""

Vizing's theorem states that a graph can be edge-colored in either Delta or Delta+1 colors, where Delta is the maximum vertex degree of the graph. A graph with edge chromatic ...

A hexahedron is a polyhedron with six faces. The figure above shows a number of named hexahedra, in particular the acute golden rhombohedron, cube, cuboid, hemicube, ...

Given a triangle DeltaABC and the excentral triangle DeltaJ_AJ_BJ_C, define the A^'-vertex of the hexyl triangle as the point in which the perpendicular to AB through the ...

The canonical bundle is a holomorphic line bundle on a complex manifold which is determined by its complex structure. On a coordinate chart (z_1,...z_n), it is spanned by the ...

A graph is claw-free iff it does not contain the complete bipartite graph K_(1,3) (known as the "claw graph"; illustrated above) as a forbidden induced subgraph. The line ...

Let a space curve have line elements ds_N, ds_T, and ds_B along the normal, tangent, and binormal vectors respectively, then ds_N^2=ds_T^2+ds_B^2, (1) where ds_N^2 = ...

Orthogonal circles are orthogonal curves, i.e., they cut one another at right angles. By the Pythagorean theorem, two circles of radii r_1 and r_2 whose centers are a ...

The area Delta (sometimes also denoted sigma) of a triangle DeltaABC with side lengths a, b, c and corresponding angles A, B, and C is given by Delta = 1/2bcsinA (1) = ...

The fractional edge chromatic number of a graph G is the fractional analog of the edge chromatic number, denoted chi_f^'(G) by Scheinerman and Ullman (2011). It can be ...

Green's theorem is a vector identity which is equivalent to the curl theorem in the plane. Over a region D in the plane with boundary partialD, Green's theorem states ...