684 search results - page 2 / 137 » A characterization of b-perfect graphs |
COMBINATORICS
2006
13 years 5 months ago
2006
![Characterization of [1, k]-Bar Visibility Trees](https://www.sciweavers.org/files/imagecache/thumbnail/imagecache/characterization_of_1_k_bar_visibility_trees_COMBINATORICS_2006.jpg "Characterization of [1, k]-Bar Visibility Trees")
A unit bar-visibility graph is a graph whose vertices can be represented in the plane by disjoint horizontal unit-length bars such that two vertices are adjacent if and only if th...
DAM
2008
13 years 5 months ago
2008
A clique-transversal of a graph G is a subset of vertices that meets all the cliques of G. A clique-independent set is a collection of pairwise vertex-disjoint cliques. The clique...
ACTA
2005
13 years 5 months ago
2005
In the hierarchy of infinite graph families, rational graphs are defined by rational transducers with labelled final states. This paper proves that their traces are precisely conte...
EJC
1998
13 years 4 months ago
1998
A hierarchy of classes of graphs is proposed which includes hypercubes, acyclic cubical complexes, median graphs, almost median graphs, premedian graphs and partial cubes. Structu...
WG
2007
Springer
13 years 11 months ago
2007
Springer