In the mathematical area of graph theory, a graph is even-hole-free if it contains no induced cycle with an even number of vertices. More precisely, the...
8 KB (727 words) - 00:05, 27 March 2025
three-vertex cycles Even-cycle-free graph, a graph without even cycles Even-hole-free graph, a graph without even cycles of length larger or equal to 6 Cycle...
15 KB (1,857 words) - 03:10, 25 February 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) - 18:32, 30 April 2025
Simplicial vertex (category Graph theory stubs)
family of all even-cycle-free graphs is χ {\displaystyle \chi } -bounded. Even-hole-free graph χ {\displaystyle \chi } -bounded family of graphs Agnarsson...
3 KB (306 words) - 04:37, 2 June 2025
Induced path (redirect from Graph hole)
the graphs with no induced path of length three. The chordal graphs are the graphs with no induced cycle of length four or more. The even-hole-free graphs...
13 KB (1,486 words) - 07:48, 18 July 2024
Χ-bounded (category Graph coloring)
precisely, the even-cycle-free graphs, which is free of holes of length 4), with f ( t ) = 2 t {\displaystyle f(t)=2t} , as every such graph has a bisimplicial...
13 KB (1,522 words) - 08:08, 27 March 2025
perfect graphs. Other superclasses of chordal graphs include weakly chordal graphs, cop-win graphs, odd-hole-free graphs, even-hole-free graphs, and Meyniel...
19 KB (2,164 words) - 07:51, 18 July 2024
In graph theory, an area of mathematics, a claw-free graph is a graph that does not have a claw as an induced subgraph. A claw is another name for the...
29 KB (3,914 words) - 07:57, 25 November 2024
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
they belong to the same block in G. Vušković, Kristina (2010), "Even-hole-free graphs: A survey" (PDF), Applicable Analysis and Discrete Mathematics,...
8 KB (985 words) - 08:35, 13 January 2025
Greedy coloring (category Graph coloring)
} -perfect graphs. If a graph and its complement graph are both even-hole-free, they are both β {\displaystyle \beta } -perfect. The graphs that are both...
32 KB (3,887 words) - 07:06, 3 December 2024
In a hole-free rectilinear polygon, all maximal squares are either continuators or separators; thus, such a polygon is analogous to a tree graph. A general...
17 KB (2,229 words) - 21:28, 19 June 2025
In graph theory, a planar graph is a graph that can be embedded in the plane, i.e., it can be drawn on the plane in such a way that its edges intersect...
35 KB (4,541 words) - 18:29, 29 May 2025
The Google Knowledge Graph is a knowledge base from which Google serves relevant information in an infobox beside its search results. This allows the...
14 KB (1,366 words) - 13:29, 19 June 2025
Rhombicosidodecahedron (redirect from Rhombicosidodecahedral graph)
pentagrammic prisms. In the mathematical field of graph theory, a rhombicosidodecahedral graph is the graph of vertices and edges of the rhombicosidodecahedron...
15 KB (1,115 words) - 17:53, 22 April 2025
the central triangle), or hole (cycle of length four or more), The incomparability graphs of semiorders, The undirected graphs that have a linear order...
17 KB (1,898 words) - 19:13, 7 November 2023
In graph theory, a branch of discrete mathematics, a distance-hereditary graph (also called a completely separable graph) is a graph in which the distances...
19 KB (2,290 words) - 21:19, 17 October 2024
along a linear axis). Graph representations, hint definitions or volume decompositions are much more difficult to define for 3D and free form features. The...
17 KB (2,464 words) - 03:36, 31 July 2024
Paul Seymour (mathematician) (category Graph theorists)
theorem, linkless embeddings, graph minors and structure, the perfect graph conjecture, the Hadwiger conjecture, claw-free graphs, χ-boundedness, and the Erdős–Hajnal...
22 KB (2,285 words) - 19:10, 7 March 2025
theory Scale-free network – Network whose degree distribution follows a power law Shortest path problem – Computational problem of graph theory Broadbent...
26 KB (3,133 words) - 05:14, 12 April 2025
Social network (redirect from Social graphs)
field which emerged from social psychology, sociology, statistics, and graph theory. Georg Simmel authored early structural theories in sociology emphasizing...
66 KB (7,365 words) - 19:39, 23 May 2025
through a looseleaf service (1914). Ring binder Hole punch Paper size Ruled paper Genkō yōshi Graph paper Post-it note Bookbinding Notebook Index card...
13 KB (1,815 words) - 02:12, 9 February 2025
Innermost stable circular orbit (category Black holes)
does not free enough potential energy for the orbital speed necessary: the acceleration gained is too little. This is usually shown by a graph of the orbital...
8 KB (1,343 words) - 01:31, 19 June 2025
problem to a planar incidence graph. In other words, it asks whether the variables of a given Boolean formula—whose incidence graph consisting of variables...
16 KB (2,166 words) - 23:33, 3 June 2025
radius of the larger sphere, it is no longer possible to fit into even the octahedral holes of the close-packed structure. Thus, beyond this point, either...
28 KB (3,419 words) - 21:01, 19 June 2025
intentions to one another in the form of promises. Promise theory is grounded in graph theory and set theory. The goal of promise theory is to reveal the behavior...
20 KB (2,212 words) - 03:28, 14 December 2024
large graph G. Victor knows G but not the cycle (e.g., Peggy has generated G and revealed it to him.) Finding a Hamiltonian cycle given a large graph is...
64 KB (7,955 words) - 00:29, 5 June 2025
contains blackbody radiation and will emit it through a hole made in its wall, provided the hole is small enough to have a negligible effect upon the equilibrium...
69 KB (8,779 words) - 00:32, 24 June 2025
or when they are more to the left on the graph, meaning closer to the attracting body. For example, even though the Sun has a stronger overall gravitational...
24 KB (2,884 words) - 19:46, 21 May 2025
crucially depends on whether the raw polygon is allowed to have holes. If the raw polygon is hole-free, then an optimal partition can be found in time O ( n 4...
19 KB (2,525 words) - 01:10, 25 June 2025