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
On the Recognition of P4-Comparability Graphs
TL;DR: This paper describes an O(nm)-time, O(n+m)-space algorithm for the recognition of P4-comparability graphs and computes the P4s of the input graph G by means of the BFS-trees of the complement of G rooted at each of its vertices.
Posted Content
Large induced subgraphs via triangulations and CMSO
TL;DR: In this paper, the problem of finding a maximum induced subgraph with at most l copies of cycles of length 0 modulo m is solved in time O(1.7347 n) for arbitrary graphs and in polynomial time for graph classes with polynomially many minimal separators.
Posted Content
Transitive oriented 3-Hypergraphs of cyclic orders
TL;DR: The definition of transitivity for oriented 3-hypergraphs is introduced in order to study partial and complete cyclic orders and the 3- hypergraph associated to a cyclic permutation is introduced.
Generalized Strongly Chordal Graphs
TL;DR: In this paper, a generalization of strongly chordal graphs is discussed and the authors consider characteristic elimination orderings for these graphs and prove the perfectness of these graphs with respect to certain properties.
Proceedings ArticleDOI
Algorithmic complexity of finding cross-cycles in flag complexes
Michal Adamaszek,Juraj Stacho +1 more
TL;DR: It is proved that even for chordal graphs, it is NP-complete to decide if there is a cross-cycle of a given cardinality, and hence, if a particular homology group of the independence complex is nontrivial.
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.