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
Subexponential interval graphs generated by immigration–death processes
TL;DR: In this article, a simple model of random interval graphs generated by immigration-death processes (also known as M/G/∞ queuing processes), where the length of each interval follows a subexponential distribution, was proposed.
Properties, Learning Algorithms, and Applications of Chain Graphs and Bayesian Hypergraphs
TL;DR: This thesis proposes new feasible and efficient structure learning algorithms to learn chain graphs from data under the faithfulness assumption and considers a more general graphical structure, namely directed acyclic graph.
Planar Graphs and Partial k-Trees
TL;DR: It is proved that any Hamiltonian planar graph on n vertices can be decomposed into a forest and a graph of O(log n) treewidth, and provided an efficient algorithm for constructing this decomposition.
Posted Content
Hardness and structural results for half-squares of restricted tree convex bipartite graphs
Hoang-Oanh Le,Van Bang Le +1 more
TL;DR: The first hardness case is identified, namely that deciding if a graph is a half-square of a balanced bisplit graph is NP-complete.
Journal ArticleDOI
Min-Orderable Digraphs
TL;DR: This work unify several seemingly different graph and digraph classes under one umbrella, which are all, broadly speaking, different generalizations of interval graphs, and include, in addition to the above, the interval graph class and the interval digraph class.
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.