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

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

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

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

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

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

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

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

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

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

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 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 graph theory, a mathematical discipline, a factor-critical graph (or hypomatchable graph) is a graph with an odd number of vertices in which deleting...

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

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

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

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

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

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

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

graph over the whole sentence. There are broadly three modern paradigms for modelling dependency parsing: transition-based, grammar-based, and graph-based...

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

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

words … I'd be a better public speaker." —Homer Simpson "If I am reading this graph correctly—I'd be very surprised." —Stephen Colbert "If all the girls attending...

fermentation and in the early stages of baking. An analysis of the recorded graph of pressure vs. bubble volume yields about ten values that characterize...

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