684 search results - page 23 / 137 » A characterization of b-perfect graphs |
106
Voted
CORR
2007
Springer
15 years 1 months ago
2007
Springer
Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical prop...
121
click to vote
WG
1993
Springer
15 years 5 months ago
1993
Springer
Recently in several papers, graphs with maximum neighborhood orderings were characterized and turned out to be algorithmically useful. This paper gives a unified framework for cha...
108
click to vote
COMBINATORICA
2004
15 years 1 months ago
2004
We extend the basic theory concerning the cycle space of a finite graph to arbitrary infinite graphs, using as infinite cycles the homeomorphic images of the unit circle in the gr...
109
click to vote
DM
2007
15 years 1 months ago
2007
We consider a variety of connections between threshold graphs, shifted complexes, and simplicial complexes naturally formed from a graph. These graphical complexes include the inde...
70
Voted
DM
2000
15 years 1 months ago
2000
We characterize the finite graph algebras which are dualizable. Indeed, a finite graph algebra is dualizable if and only if each connected component of the underlying graph is eith...