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
Méthodes ordinales et combinatoires en analyse des données
A. Guenoche,B. Monjardet +1 more
TL;DR: A set of methods using ordinal or combinatorial techniques for Boolean analysis and graph theory approach for binary data, tree representations, seriation methods for symmetric or not symmetric dissimilarity arrays, preferences aggregation procedures and consensus problems are studied.
Journal ArticleDOI
Partitioned probe comparability graphs
TL;DR: This paper shows that there exists a polynomial-time algorithm for the recognition of partitioned probe graphs of comparability graphs of cocomparability graphs and shows that a partitioned graph G is a partitioning probe permutation graph if and only if G is at the same time a partitionED probe graph of comparable and cocomParability graphs.
Journal ArticleDOI
On interval graphs and matrice profiles
TL;DR: A l'aide d'une caracterisation des graphes d'intervalles par Tarjan, on demontre que le problem de the minimisation du profil d'un matrice creuse et symetrique est NP-complet as discussed by the authors.
Journal ArticleDOI
Supersolvable Frame-matroid and Graphic-lift Lattices
TL;DR: This work characterize modular coatoms in and supersolvability of graphic lifts of finite rank and describes explicitly the frames that are supersolvable.
Journal ArticleDOI
Interval degree and bandwidth of a graph
Fedor V. Fomin,Petr A. Golovach +1 more
TL;DR: The interval degree id(G) of a graph G is defined to be the smallest max-degree of any interval supergraphs of G and it is proved that for any graph G the interval degree of G is at least the pathwidth of G2.
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.