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
Book ChapterDOI
Minimal interval completions
TL;DR: A polynomial time algorithm is given to obtain a minimal interval completion of an arbitrary graph, thereby resolving the complexity of this problem.
Proceedings ArticleDOI
Triangulating three-colored graphs
Sampath Kannan,Tandy Warnow +1 more
TL;DR: This paper presents an almost linear time algorithm for determining whether the authors can triangulate a vertex-colored graph without introducing edges between vertices of the same color in the case that the graph is three colored.
Journal ArticleDOI
Constant delay enumeration for conjunctive queries: a tutorial
TL;DR: This paper is the tutorial the authors wish they had had available when starting their own research on constant delay enumeration for conjunctive queries and provides precise statements and detailed, self-contained proofs of the fundamental results.
Journal ArticleDOI
The Number of Spanning Trees in K n -Complements of Quasi-Threshold Graphs
TL;DR: These proofs are based on the complement spanning-tree matrix theorem, which expresses the number of spanning trees of a graph as a function of the determinant of a matrix that can be easily constructed from the adjacency relation of the graph.
Book ChapterDOI
Backbone Colorings for Networks
TL;DR: The cases where the backbone is either a spanning tree or a spanning path, and the colors assigned to adjacent vertices in H differ by at least two, are concentrated on.
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.