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
Recognizing some subclasses of vertex intersection graphs of 0-bend paths in a grid
TL;DR: In the paper, polynomial time algorithms are described for recognizing chordal B0 -VPG graphs, and for recognizing B0 + VPG graphs that have a representation on a grid with 2 rows.
Journal ArticleDOI
Chromatic polynomials and order ideals of monomials
TL;DR: This work describes here how to explicitly carry out this construction algebraically and applies this viewpoint to prove a new bound for the roots of chromatic polynomials.
Proceedings ArticleDOI
Factoring and recognition of read-once functions using cographs and normality
TL;DR: A very fast algorithm for recognizing and factoring read-once functions which is needed as a dedicated factoring subroutine to handle the lower levels of that factoring process.
Posted Content
On the switch Markov chain for perfect matchings
TL;DR: The mixing time of the switch chain is polynomial in the case of monotone graphs, a class of graphs that includes examples of interest in the statistical setting as mentioned in this paper.
Posted Content
Perfect graphs: a survey
TL;DR: A survey about perfect graphs, mostly focused on the strong perfect graph theorem, which was proved by Chudnovsky, Robertson, Seymour and Thomas in 2002.
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.