Journal ArticleDOI
Algorithmic graph theory and perfect graphs
Reads0
Chats0
About:
This article is published in Order.The article was published on 1986-06-01. It has received 1324 citations till now. The article focuses on the topics: Trivially perfect graph & Perfect graph theorem.read more
Citations
More filters
Journal ArticleDOI
Partial characterizations of clique-perfect graphs
TL;DR: A partial result is presented, that is, clique-perfect graphs are characterized by a restricted list of forbidden induced subgraphs when the graph belongs to a certain class.
The Structure of the Intersection of Tolerance and Cocomparability Graphs
George B. Mertzios,Shmuel Zaks +1 more
TL;DR: Golumbic, Monma, and Trotter as discussed by the authors proved that the intersection of tolerance and cocomparability graphs coincides with bounded tolerance graphs, and showed that the conjecture is true for complements of trees and bipartite graphs.
Posted Content
Recognizing Interval Bigraphs by Forbidden Patterns
TL;DR: This work transforms the problem of finding the desired ordering to choosing strong components of a pair‐digraph without creating conflicts and makes use of the structure of the pair-digraph as well as decomposition of bigraph H based on the special components of the Pair‐Digraph.
Book ChapterDOI
From path graphs to directed path graphs
TL;DR: A linear time algorithm to greedily orient the edges of a path graph model to obtain a directed path graphs model (when possible) and is extended to find an odd sun when the method fails.
Journal ArticleDOI
Coloring permutation graphs in parallel
TL;DR: It is shown that the problem of coloring a permutation graph is equivalent to finding vertex levels in the coloring-permutation tree, and an efficient parallel algorithm is proposed which colors an n-node permutations graph in O(log2 n) time using O(n2/log n) processors on the CREW PRAM model.
References
More filters
Journal ArticleDOI
Interval graphs and related topics
TL;DR: A more general paradigm for studying various classes of graphs is suggested which can be described as follows: when 9 is allowed to be an arbitrary family of sets, the class obtained as intersection graphs is all undirected graphs.