1972 search results - page 86 / 395 » connection 2008 |
131
click to vote
DM
2006
15 years 5 months ago
2006
A graph is called biclaw-free if it has no biclaw as an induced subgraph. In this note, we prove that if G is a connected bipartite biclaw-free graph with (G) 5, then G is collap...
130
click to vote
IVC
2008
15 years 5 months ago
2008
The preservation of topological properties during digitization is a hard problem in 3 and higher dimensions. Only for the very restricted class of r-regular shapes it is known tha...
176
click to vote
JCT
2008
15 years 5 months ago
2008
Given an undirected hypergraph and a subset of vertices S V with a specified root vertex r S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the hypered...
142
click to vote
DM
2007
15 years 5 months ago
2007
We present an algorithm that determines the prime factors of connected graphs with respect to the Cartesian product in linear time and space. This improves a result of Aurenhammee...
153
click to vote
DM
2007
15 years 5 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...