27 relations: Biconnected graph, Clique (graph theory), Combinatorica, Complete graph, Connectivity (graph theory), Cycle graph, Degree (graph theory), Dense graph, Edge coloring, Equitable coloring, Graph (discrete mathematics), Graph coloring, Graph theory, Greedy coloring, Information Processing Letters, Journal of Combinatorial Theory, List coloring, Mathematical Proceedings of the Cambridge Philosophical Society, Mehdi Behzad, Neighbourhood (graph theory), R. Leonard Brooks, Regular graph, SIAM Journal on Discrete Mathematics, Spanning tree, Total coloring, Triangle-free graph, Vizing's theorem.
Biconnected graph
In graph theory, a biconnected graph is a connected and "nonseparable" graph, meaning that if any one vertex were to be removed, the graph will remain connected.
New!!: Brooks' theorem and Biconnected graph · See more »
Clique (graph theory)
In the mathematical area of graph theory, a clique is a subset of vertices of an undirected graph such that every two distinct vertices in the clique are adjacent; that is, its induced subgraph is complete.
New!!: Brooks' theorem and Clique (graph theory) · See more »
Combinatorica
Combinatorica is an international journal of mathematics, publishing papers in the fields of combinatorics and computer science.
New!!: Brooks' theorem and Combinatorica · See more »
Complete graph
No description.
New!!: Brooks' theorem and Complete graph · See more »
Connectivity (graph theory)
In mathematics and computer science, connectivity is one of the basic concepts of graph theory: it asks for the minimum number of elements (nodes or edges) that need to be removed to disconnect the remaining nodes from each other.
New!!: Brooks' theorem and Connectivity (graph theory) · See more »
Cycle graph
In graph theory, a cycle graph or circular graph is a graph that consists of a single cycle, or in other words, some number of vertices connected in a closed chain.
New!!: Brooks' theorem and Cycle graph · See more »
Degree (graph theory)
In graph theory, the degree (or valency) of a vertex of a graph is the number of edges incident to the vertex, with loops counted twice.
New!!: Brooks' theorem and Degree (graph theory) · See more »
Dense graph
In mathematics, a dense graph is a graph in which the number of edges is close to the maximal number of edges.
New!!: Brooks' theorem and Dense graph · See more »
Edge coloring
In graph theory, an edge coloring of a graph is an assignment of "colors" to the edges of the graph so that no two adjacent edges have the same color.
New!!: Brooks' theorem and Edge coloring · See more »
Equitable coloring
In graph theory, an area of mathematics, an equitable coloring is an assignment of colors to the vertices of an undirected graph, in such a way that.
New!!: Brooks' theorem and Equitable coloring · See more »
Graph (discrete mathematics)
In mathematics, and more specifically in graph theory, a graph is a structure amounting to a set of objects in which some pairs of the objects are in some sense "related".
New!!: Brooks' theorem and Graph (discrete mathematics) · See more »
Graph coloring
In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called "colors" to elements of a graph subject to certain constraints.
New!!: Brooks' theorem and Graph coloring · See more »
Graph theory
In mathematics, graph theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects.
New!!: Brooks' theorem and Graph theory · See more »
Greedy coloring
In the study of graph coloring problems in mathematics and computer science, a greedy coloring is a coloring of the vertices of a graph formed by a greedy algorithm that considers the vertices of the graph in sequence and assigns each vertex its first available color.
New!!: Brooks' theorem and Greedy coloring · See more »
Information Processing Letters
Information Processing Letters is a peer reviewed scientific journal in the field of computer science, published by Elsevier.
New!!: Brooks' theorem and Information Processing Letters · See more »
Journal of Combinatorial Theory
The Journal of Combinatorial Theory, Series A and Series B, are mathematical journals specializing in combinatorics and related areas.
New!!: Brooks' theorem and Journal of Combinatorial Theory · See more »
List coloring
In graph theory, a branch of mathematics, list coloring is a type of graph coloring where each vertex can be restricted to a list of allowed colors.
New!!: Brooks' theorem and List coloring · See more »
Mathematical Proceedings of the Cambridge Philosophical Society
Mathematical Proceedings of the Cambridge Philosophical Society is a mathematical journal published by Cambridge University Press for the Cambridge Philosophical Society.
New!!: Brooks' theorem and Mathematical Proceedings of the Cambridge Philosophical Society · See more »
Mehdi Behzad
Mehdi Behzad (Persian:مهدی بهزاد; born April 22, 1936) is an Iranian mathematician specializing in graph theory.
New!!: Brooks' theorem and Mehdi Behzad · See more »
Neighbourhood (graph theory)
In graph theory, an adjacent vertex of a vertex v in a graph is a vertex that is connected to v by an edge.
New!!: Brooks' theorem and Neighbourhood (graph theory) · See more »
R. Leonard Brooks
Rowland Leonard Brooks (February 6, 1916 – June 18, 1993), squaring.net, retrieved 2010-07-30.
New!!: Brooks' theorem and R. Leonard Brooks · See more »
Regular graph
In graph theory, a regular graph is a graph where each vertex has the same number of neighbors; i.e. every vertex has the same degree or valency.
New!!: Brooks' theorem and Regular graph · See more »
SIAM Journal on Discrete Mathematics
SIAM Journal on Discrete Mathematics is a peer-reviewed mathematics journal published quarterly by the Society for Industrial and Applied Mathematics (SIAM).
New!!: Brooks' theorem and SIAM Journal on Discrete Mathematics · See more »
Spanning tree
In the mathematical field of graph theory, a spanning tree T of an undirected graph G is a subgraph that is a tree which includes all of the vertices of G, with minimum possible number of edges.
New!!: Brooks' theorem and Spanning tree · See more »
Total coloring
In graph theory, total coloring is a type of graph coloring on the vertices and edges of a graph.
New!!: Brooks' theorem and Total coloring · See more »
Triangle-free graph
In the mathematical area of graph theory, a triangle-free graph is an undirected graph in which no three vertices form a triangle of edges.
New!!: Brooks' theorem and Triangle-free graph · See more »
Vizing's theorem
In graph theory, Vizing's theorem (named for Vadim G. Vizing who published it in 1964) states that every simple undirected graph may be edge colored using a number of colors that is at most one larger than the maximum degree of the graph.
New!!: Brooks' theorem and Vizing's theorem · See more »
Redirects here:
Brooks's theorem, Brooks’ theorem.
References
[1] https://en.wikipedia.org/wiki/Brooks'_theorem