Uniquely Partially Orderable Graphs
نویسنده
چکیده
منابع مشابه
Complete Problems for Monotone NP
We show that the problem of deciding whether a digraph has a Hamiltonian path between two specified vertices and the problem of deciding whether a given graph has a cubic subgraph are complete for monotone NP via monotone projection translations. We also show that the problem of deciding whether a uniquely partially orderable (resp. comparability) graph has a cubic subgraph is complete for NP v...
متن کاملThe Dimension of a Comparability Graph
Dushnik and Miller defined the dimension of a partial order P as the minimum number of linear orders whose intersection is P. Ken Bogart asked if the dimension of a partial order is an invariant of the associated comparability graph. In this paper we answer Bogart's question in the affirmative. The proof involves a characterization of the class of comparability graphs defined by Aigner and Prin...
متن کاملOn Some Cograph Extensions and Their Algorithms
This paper reviews some classes of graphs related to cographs. The characterization of cographs by which there is no induced path on three edges (P4) is relaxed in various ways. Considered are classes of graphs that are uniquely representable by trees. Three such classes studied here are: P4-reducible, P4-sparse and P4-extendible graphs. In addition, we show that the class of P4-lite graphs has...
متن کاملOn the Structure of Bull-Free Perfect Graphs, 2: the Weakly Chordal Case
A bull is a graph obtained by adding a pendant vertex at two vertices of a triangle. A graph is perfectly orderable if it admits an ordering such that the greedy sequential method applied on this ordering produces an optimal coloring for every induced subgraph. Chv atal conjectured that every bull-free graph with no odd hole or antihole is perfectly orderable. In a previous paper we studied the...
متن کاملThe Story of Perfectly Orderable Graphs
We give the story behind one examplar of the work of VašekChvátal, namely his conception of the class of perfectly orderable graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1969