Information om | Engelska ordet ORDERABLE

Exempel på hur man kan använda ORDERABLE i en mening

• Comparability graphs have also been called transitively orientable graphs, partially orderable graphs, containment graphs, and divisor graphs.
• The perfectly orderable graphs (which include chordal graphs, comparability graphs, and distance-hereditary graphs) are defined as graphs that have a hereditarily optimal ordering.
• The reverse of this ordering therefore satisfies the requirements of a perfect ordering, so graphs with semiperfect elimination orderings are perfectly orderable.
• An induced subgraph of a chordal graph is chordal and the induced subsequence of its perfect elimination ordering is a perfect elimination ordering on the subgraph, so chordal graphs are perfectly orderable, and lexicographic breadth-first search can be used to optimally color them.

Förberedelsen av sidan tog: 103,45 ms.