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...

algorithm with this ordering optimally colors every induced subgraph. The perfectly orderable graphs are a subclass of the perfect graphs. 3.  A perfect matching...

parity graph, a Meyniel graph, and a perfectly orderable graph. Line perfect graphs generalize the bipartite graphs, and share with them the properties...

order. Comparability graphs have also been called transitively orientable graphs, partially orderable graphs, containment graphs, and divisor graphs....

the graphs for which all vertex orderings have this property. Another subclass of perfectly orderable graphs are the complements of tolerance graphs, a...

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...

by choosing the vertex ordering to be the reverse of a perfect elimination ordering for the graph. The perfectly orderable graphs generalize this property...

chordal graphs are perfect, the size of this clique equals the chromatic number of the chordal graph. Chordal graphs are perfectly orderable: an optimal...

distance-hereditary graphs) are defined as graphs that have a hereditarily optimal ordering. Recognizing perfectly orderable graphs is also NP-complete...

graph is a perfect graph, more specifically a perfectly orderable graph and a Meyniel graph. Every distance-hereditary graph is also a parity graph,...

Because strongly perfect graphs, perfectly orderable graphs, distance-hereditary graphs, and comparability graphs are all perfect graphs, cographs are also...

larger class of graphs, the distance-hereditary graphs: distance-hereditary graphs are perfectly orderable, with a perfect ordering given by the reverse...

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...

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...

combinatorics, algebraic, differential, discrete and Euclidean geometries, graph theory, group theory, model theory, number theory, set theory, Ramsey theory...

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...

with certain extra first-order properties. Completeness is not a first-order property of lattices. The signature of graphs has no constants or functions...

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...

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...

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...

point. Take the [Relationship between marginal cost and average total cost] graph as a representation. Say the starting point of level of output produced...

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...

audio compression method Data reduction, simplifying data in order to facilitate analysis Graph reduction, an efficient version of non-strict evaluation L-reduction...

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...

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...

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...

optimization problems are NP-complete, or even undecidable. Also, producing perfectly optimal code is not possible since optimizing for one aspect often degrades...

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...

modeled by that of an ideal CSTR, which assumes perfect mixing. In a perfectly mixed reactor, reagent is instantaneously and uniformly mixed throughout...

contrary to the expected utility theory (which models the decision that perfectly rational agents would make), prospect theory aims to describe the actual...