684 search results - page 15 / 137 » A characterization of b-perfect graphs |
COLOGNETWENTE
2009
15 years 25 days ago
2009
: Weakly quasi-threshold graphs form a proper subclass of the well-known class of cographs by restricting the join operation. In this paper we characterize weakly quasi-threshold g...
106
click to vote
GECCO
2006
Springer
15 years 3 months ago
2006
Springer
This paper introduces a metric that measures symmetry in tree graphs, which allows for a statistical characterization of GP solutions by their architectural "shapes." A ...
108
click to vote
ESA
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. A level graph is a directed acyclic graph with a level assignment for each node. Such graphs play a prominent role in graph drawing. They express strict dependencies and ...
DM
2006
14 years 11 months ago
2006
We provide a simple constructive characterization for trees with equal domination and independent domination numbers, and for trees with equal domination and total domination numb...
123
click to vote
ISAAC
2010
Springer
14 years 9 months ago
2010
Springer
A permutation graph is an intersection graph of segments lying between two parallel lines. A Seidel complementation of a finite graph at a vertex v consists in complementing the ed...