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
Complexity of conditional colorability of graphs
TL;DR: It is shown that conditional (3,2)-colorability remains NP-complete when restricted to planar bipartite graphs with maximum degree at most 3 and arbitrarily high girth, and it is proved that some other well-known complexity results for traditional coloring still hold for conditional coloring.
Book ChapterDOI
On bin packing with conflicts
Leah Epstein,Asaf Levin +1 more
TL;DR: The first lower bound on the asymptotic competitive ratio of any online bin packing algorithm with known optimal value is introduced, which is $\frac {47}{36}\approx 1.30556$.
Journal ArticleDOI
An Optimal Algorithm To Recognize Robinsonian Dissimilarities
Pascal Préa,Dominique Fortin +1 more
TL;DR: This paper presents an optimal O (n2) algorithm to recognize Robinsonian dissimilarities, where n is the cardinal of S and improves the already known algorithms.
Journal ArticleDOI
Clique r -Domination and Clique r -Packing Problems on Dually Chordal Graphs
TL;DR: An efficient algorithm is proposed for solving the clique r-domination problem and the cliques r-packing problem on dually chordal graphs which are a natural generalization of strongly chordalGraphs.
Journal ArticleDOI
Constant tolerance intersection graphs of subtrees of a tree
TL;DR: Under certain conditions representations of larger graphs can be obtained from those of smaller ones by amalgamation procedures, and representability and non-representability results are presented.
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.