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
Proceedings ArticleDOI
A Graph-Theoretic Barcode Ordering Model for Linked-Reads
TL;DR: A framework is proposed that takes as input an arbitrary intersection graph (such as an overlap graph of barcodes) and constructs a heuristic approximation of the ordering of the original intervals, to facilitate analyses of linked-reads sequencing data.
DissertationDOI
Transversals of graphs
TL;DR: In this article, the minimum cardinality of a transversal in a given graph class was studied and an upper bound on its cardinality was shown for longest paths, longest cycles and triangles.
Dissertation
Cycletrees: a Novel Class of Interconnection Graphs
TL;DR: It is argued that cycletrees reflect the communication patterns of several common parallel programming paradigms and can be used in various fields of parallel computation.
Journal ArticleDOI
On the proper intervalization of colored caterpillar trees
Carme Àlvarez,Maria Serna +1 more
TL;DR: This paper studies the computational complexity of the proper interval colored graph problem (PICG), when the input graph is a colored caterpillar, parameterized by hair length and establishes a close relationship between the PICG and a graph layout problem the proper colored layout problem ( PCLP).
Book ChapterDOI
Complexity of Steiner Tree in Split Graphs - Dichotomy Results
TL;DR: An interesting dichotomy is presented: it is shown that Steiner tree on K_{1,4}-free split graphs is polynomial-time solvable, whereas, Steiner Tree on K_1,5-freesplit graphs is NP-complete.
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.