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
Notes on a theorem of Naji
TL;DR: For bipartite graphs, Naji's theorem is equivalent to an algebraic characterization of planar matroids due to J. Geelen and B. Gerards and Naji’s theorem also yields an algebraIC characterization of permutation graphs.
Bounds for linear VLSI-layout problems
TL;DR: This thesis develops structural and algorithmic approaches for the computation of bounds for optimization problems that arise in the context of linear VLSI layout styles with the help of the new notion of alternating-acyclic mixed graphs and proves NP-completeness already when it is restricted to the class of 3-regular graphs.
Journal ArticleDOI
Finding a maximum matching in a permutation graph
Chongkye Rhee,Y. Daniel Liang +1 more
TL;DR: AnO(n log logn) time algorithm for finding a maximum matching in a permutation graph withn vertices, assuming that the input graph is represented by a permutations.
Book ChapterDOI
Maintenance of a Percing Set for Intervals with Applications
TL;DR: Efficient (sometimes improved) solutions to the following three problems are obtained: the shooter location problem, computing a minimum piercing set for arcs on a circle, and dynamically maintaining a box cover for a d-dimensional point set.
Posted Content
Word-representability of split graphs
TL;DR: In this article, the authors characterize in terms of forbidden subgraphs word-representable split graphs in which vertices in the independent set are of degree at most 2, or the size of the clique is 4.
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.