Search Results for ""

König's line coloring theorem states that the edge chromatic number of any bipartite graph equals its maximum vertex degree. In other words, every bipartite graph is a class ...

The closed graph theorem states that a linear operator between two Banach spaces X and Y is continuous iff it has a closed graph, where the "graph" {(x,f(x)):x in X} is ...

The graph complement of a graph hole. Graph antiholes are called even if they have an even number of vertices and odd if they have an odd number of vertices (Chvátal). No odd ...

A section of a graph obtained by finding its intersection with a plane.

The central point in a wheel graph W_n. The hub has degree n-1.

The graph complement of a perfect graph is itself perfect. Originally known as the weak perfect graph conjecture (Fulkerson 1971), the result was subsequently proved by ...

Bonato et al. (2014, 2015) defined the burning number of a simple graph as follows. Consider a process called burning involving are discrete time steps. Each node is either ...

Combinatorics is the branch of mathematics studying the enumeration, combination, and permutation of sets of elements and the mathematical relations that characterize their ...

A circuit in which an entire graph is traversed in one route. Examples of curves that can be traced unicursally are the Mohammed sign and unicursal hexagram. The numbers of ...

In complex analysis, a branch (also called a sheet) is a portion of the range of a multivalued function over which the function is single-valued. Combining all the sheets ...