graph theory, a perfectly orderable graph is a graph whose vertices can be ordered in such a way that a greedy coloring algorithm with that ordering optimally...
10 KB (1,149 words) - 08:26, 16 July 2024
algorithm with this ordering optimally colors every induced subgraph. The perfectly orderable graphs are a subclass of the perfect graphs. 3. A perfect matching...
109 KB (16,011 words) - 18:32, 30 April 2025
parity graph, a Meyniel graph, and a perfectly orderable graph. Line perfect graphs generalize the bipartite graphs, and share with them the properties...
3 KB (300 words) - 21:20, 27 March 2024
order. Comparability graphs have also been called transitively orientable graphs, partially orderable graphs, containment graphs, and divisor graphs....
13 KB (1,398 words) - 07:00, 10 May 2025
of time. Every interval graph is a tolerance graph. The complement graph of every tolerance graph is a perfectly orderable graph, from which it follows...
3 KB (315 words) - 07:06, 18 July 2024
the graphs for which all vertex orderings have this property. Another subclass of perfectly orderable graphs are the complements of tolerance graphs, a...
59 KB (7,055 words) - 07:30, 25 February 2025
by choosing the vertex ordering to be the reverse of a perfect elimination ordering for the graph. The perfectly orderable graphs generalize this property...
70 KB (8,459 words) - 05:58, 16 May 2025
Greedy coloring (category Graph coloring)
distance-hereditary graphs) are defined as graphs that have a hereditarily optimal ordering. Recognizing perfectly orderable graphs is also NP-complete...
32 KB (3,887 words) - 07:06, 3 December 2024
chordal graphs are perfect, the size of this clique equals the chromatic number of the chordal graph. Chordal graphs are perfectly orderable: an optimal...
19 KB (2,164 words) - 07:51, 18 July 2024
graph is a perfect graph, more specifically a perfectly orderable graph and a Meyniel graph. Every distance-hereditary graph is also a parity graph,...
19 KB (2,290 words) - 21:19, 17 October 2024
Cograph (redirect from Complement-reducible graph)
Because strongly perfect graphs, perfectly orderable graphs, distance-hereditary graphs, and comparability graphs are all perfect graphs, cographs are also...
22 KB (2,689 words) - 18:27, 19 April 2025
Lexicographic breadth-first search (category Graph algorithms)
larger class of graphs, the distance-hereditary graphs: distance-hereditary graphs are perfectly orderable, with a perfect ordering given by the reverse...
11 KB (1,729 words) - 15:15, 25 October 2024
Edge coloring (category Graph coloring)
In graph theory, a proper edge coloring of a graph is an assignment of "colors" to the edges of the graph so that no two incident edges have the same color...
65 KB (8,472 words) - 14:53, 9 October 2024
In statistics, a misleading graph, also known as a distorted graph, is a graph that misrepresents data, constituting a misuse of statistics and with the...
38 KB (4,098 words) - 02:13, 8 June 2025
combinatorics, algebraic, differential, discrete and Euclidean geometries, graph theory, group theory, model theory, number theory, set theory, Ramsey theory...
195 KB (20,069 words) - 07:07, 11 June 2025
In graph theory, a mathematical discipline, a factor-critical graph (or hypomatchable graph) is a graph with an odd number of vertices in which deleting...
16 KB (1,801 words) - 02:39, 3 March 2025
of output require a lower price in order to be sold. An analogous feature holds for the input markets: in a perfectly competitive input market the firm's...
28 KB (4,131 words) - 15:05, 17 March 2025
with certain extra first-order properties. Completeness is not a first-order property of lattices. The signature of graphs has no constants or functions...
36 KB (5,269 words) - 20:51, 27 December 2024
knot vector (a list increasing numbers, usually between 0 and 1). In order to perfectly represent circles and other conic sections, a weight component is...
6 KB (888 words) - 00:36, 24 June 2024
Dessin d'enfant (category Topological graph theory)
In mathematics, a dessin d'enfant is a type of graph embedding used to study Riemann surfaces and to provide combinatorial invariants for the action of...
30 KB (4,171 words) - 20:41, 13 July 2024
point. Take the [Relationship between marginal cost and average total cost] graph as a representation. Say the starting point of level of output produced...
23 KB (3,393 words) - 06:44, 27 February 2025
audio compression method Data reduction, simplifying data in order to facilitate analysis Graph reduction, an efficient version of non-strict evaluation L-reduction...
8 KB (1,078 words) - 07:13, 6 May 2025
Rhombic dodecahedron (redirect from Rhombic dodecahedral graph)
dodecahedron is called a rhombic dodecahedral graph, with 14 vertices and 24 edges. It is the Levi graph of the Miquel configuration (83 64). For edge...
24 KB (2,412 words) - 17:34, 10 June 2025
Collinearity (section Collinearity graph)
P, where two points determine at most one line, a collinearity graph of P is a graph whose vertices are the points of P, where two vertices are adjacent...
18 KB (2,581 words) - 13:29, 15 May 2025
Distance (section Distance in graph theory)
distance. In a graph, the distance between two vertices is measured by the length of the shortest edge path between them. For example, if the graph represents...
17 KB (2,230 words) - 20:27, 9 March 2025
optimization problems are NP-complete, or even undecidable. Also, producing perfectly optimal code is not possible since optimizing for one aspect often degrades...
42 KB (5,417 words) - 00:05, 19 January 2025
Steffen Boarding Method (category Pages using the Graph extension)
human headway, as it would separate those boarding in groups, require a perfectly organised line, as well as uniform stowing and seating time. Steffen initially...
7 KB (835 words) - 02:12, 4 March 2025
A demand curve is a graph depicting the inverse demand function, a relationship between the price of a certain commodity (the y-axis) and the quantity...
20 KB (2,664 words) - 15:57, 10 April 2025
contrary to the expected utility theory (which models the decision that perfectly rational agents would make), prospect theory aims to describe the actual...
46 KB (6,531 words) - 16:35, 25 May 2025
Continuous stirred-tank reactor (section First order)
modeled by that of an ideal CSTR, which assumes perfect mixing. In a perfectly mixed reactor, reagent is instantaneously and uniformly mixed throughout...
22 KB (3,440 words) - 08:31, 14 May 2025