In graph theory, a cycle decomposition is a decomposition (a partitioning of a graph's edges) into cycles. Every vertex in a graph that has a cycle decomposition...
2 KB (293 words) - 17:57, 11 August 2023
mathematics, the term cycle decomposition can mean: Cycle decomposition (graph theory), a partitioning of the vertices of a graph into subsets, such that...
596 bytes (113 words) - 17:20, 9 November 2016
of graph theory, a chordal graph is one in which all cycles of four or more vertices have a chord, which is an edge that is not part of the cycle but...
19 KB (2,164 words) - 07:51, 18 July 2024
functions Cycle decomposition (graph theory) Cycle decomposition (group theory) Cyclic extension, a field extension with cyclic Galois group Graph theory: Cyclic...
2 KB (261 words) - 02:33, 8 May 2023
In graph theory, a bridge, isthmus, cut-edge, or cut arc is an edge of a graph whose deletion increases the graph's number of connected components. Equivalently...
11 KB (1,476 words) - 01:30, 16 June 2025
Appendix:Glossary of graph theory in Wiktionary, the free dictionary. This is a glossary of graph theory. Graph theory is the study of graphs, systems of nodes...
109 KB (16,011 words) - 12:09, 30 June 2025
Strongly connected component (redirect from Condensation (graph theory))
In the mathematical theory of directed graphs, a graph is said to be strongly connected if every vertex is reachable from every other vertex. The strongly...
13 KB (1,642 words) - 00:44, 18 June 2025
Hamiltonian path (redirect from Hamiltonian graph)
and the edges traced "tail-to-head"). A Hamiltonian decomposition is an edge decomposition of a graph into Hamiltonian circuits. A Hamilton maze is a type...
19 KB (2,043 words) - 13:05, 14 May 2025
In the mathematical field of graph theory, a bipartite graph (or bigraph) is a graph whose vertices can be divided into two disjoint and independent sets...
33 KB (4,086 words) - 21:34, 28 May 2025
In graph theory, a branch of mathematics, the Herschel graph is a bipartite undirected graph with 11 vertices and 18 edges. It is a polyhedral graph (the...
14 KB (1,667 words) - 08:08, 27 June 2025
In graph theory, a branch of mathematics, the (binary) cycle space of an undirected graph is the set of its even-degree subgraphs. This set of subgraphs...
18 KB (2,515 words) - 18:06, 7 July 2025
In graph theory, graph coloring is a methodic assignment of labels traditionally called "colors" to elements of a graph. The assignment is subject to certain...
70 KB (8,460 words) - 16:34, 7 July 2025
computer science, graph theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects. A graph in this context...
50 KB (6,237 words) - 21:13, 9 May 2025
Bivariegated graph Cage (graph theory) Cayley graph Circle graph Clique graph Cograph Common graph Complement of a graph Complete graph Cubic graph Cycle graph De...
7 KB (663 words) - 02:52, 24 September 2024
In the mathematical field of graph theory, a complete graph is a simple undirected graph in which every pair of distinct vertices is connected by a unique...
14 KB (1,253 words) - 18:25, 9 May 2025
In the mathematical discipline of graph theory, a matching or independent edge set in an undirected graph is a set of edges without common vertices. In...
24 KB (3,032 words) - 23:25, 29 June 2025
discrete and Euclidean geometries, graph theory, group theory, model theory, number theory, set theory, Ramsey theory, dynamical systems, and partial differential...
195 KB (20,033 words) - 13:09, 12 July 2025
In graph theory, a perfect graph is a graph in which the chromatic number equals the size of the maximum clique, both in the graph itself and in every...
59 KB (7,055 words) - 07:30, 25 February 2025
In graph theory, the hypercube graph Qn is the graph formed from the vertices and edges of an n-dimensional hypercube. For instance, the cube graph Q3...
13 KB (1,555 words) - 00:07, 10 May 2025
Induced path (redirect from Hole (graph theory))
In the mathematical area of graph theory, an induced path in an undirected graph G is a path that is an induced subgraph of G. That is, it is a sequence...
13 KB (1,486 words) - 07:48, 18 July 2024
Flow network (redirect from Transportation network (graph theory))
In graph theory, a flow network (also known as a transportation network) is a directed graph where each edge has a capacity and each edge receives a flow...
22 KB (3,081 words) - 08:39, 17 July 2025
graph theory, an adjacent vertex of a vertex v in a graph is a vertex that is connected to v by an edge. The neighbourhood of a vertex v in a graph G...
10 KB (1,122 words) - 08:52, 18 August 2023
In graph theory, an independent set, stable set, coclique or anticlique is a set of vertices in a graph, no two of which are adjacent. That is, it is a...
30 KB (3,564 words) - 07:50, 15 July 2025
Permutation (redirect from Cycle decomposition (group theory))
as a list of cycles; since distinct cycles involve disjoint sets of elements, this is referred to as "decomposition into disjoint cycles". To write down...
77 KB (11,657 words) - 12:37, 18 July 2025
complete graph as a minor? More unsolved problems in mathematics In graph theory, the Hadwiger conjecture states that if G {\displaystyle G} is loopless...
19 KB (2,453 words) - 22:48, 18 July 2025
graph theory, a branch of mathematics, a Hamiltonian decomposition of a given graph is a partition of the edges of the graph into Hamiltonian cycles....
15 KB (1,763 words) - 18:26, 3 July 2025
In graph theory, an outerplanar graph is a graph that has a planar drawing for which all vertices belong to the outer face of the drawing. Outerplanar...
19 KB (2,089 words) - 08:10, 14 January 2025
symmetric group. Path (graph theory) Ladder graph Caterpillar tree Complete graph Null graph Path decomposition Cycle (graph theory) While it is most common...
3 KB (289 words) - 05:54, 15 November 2024
In graph theory, the strong perfect graph theorem is a forbidden graph characterization of the perfect graphs as being exactly the graphs that have neither...
15 KB (1,769 words) - 23:06, 16 October 2024
problem. Tree decomposition is a well-known concept from graph theory. Reformulated in terms of binary constraints, a tree decomposition is a tree whose...
43 KB (5,804 words) - 06:51, 26 January 2025