199 search results - page 3 / 40 » Recognizing HHDS-Free Graphs |
WG
2004
Springer
13 years 11 months ago
2004
Springer
In this paper, we consider the recognition problem on two classes of perfectly orderable graphs, namely, the HHD-free and the Welsh-Powell opposition graphs (or WPO-graphs). In par...
DAM
2007
13 years 6 months ago
2007
We present a parallel algorithm for recognizing and representing a proper interval graph in O(log2 n) time with O(m + n) processors on the CREW PRAM, where m and n are the number ...
COMBINATORICS
2007
13 years 6 months ago
2007
We compute the list of all minimal 2-infinite diagrams, which are cluster algebraic analogues of extended Dynkin graphs.
DAM
1999
13 years 5 months ago
1999
Acyclic cubical complexes have first been introduced by Bandelt and Chepoi in analogy to acyclic simplicial complexes. They characterized them by cube contraction and elimination ...
COMBINATORICS
1998
13 years 5 months ago
1998
A circulant graph G of order n is a Cayley graph over the cyclic group Zn. Equivalently, G is circulant iff its vertices can be ordered such that the corresponding adjacency matr...