3008 search results - page 195 / 602 » Independence in connected graphs |
185
click to vote
EJC
2011
15 years 1 months ago
2011
Henning and Yeo proved a lower bound for the minimum size of a maximum matching in a connected k-regular graphs with n vertices; it is sharp infinitely often. In an earlier paper...
167
click to vote
LICS
2007
IEEE
16 years 26 days ago
2007
IEEE
We introduce the concept of locally excluded minors. Graph classes locally excluding a minor are a common generalisation of the concept of excluded minor classes and of graph clas...
163
click to vote
SEMWEB
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. Topic Maps and RDF are two independently developed paradigms and standards for the representation, interchange, and exploitation of model-based data on the web. Each para...
169
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
One of the main questions that arise when studying random and quasi-random structures is which properties P are such that any object that satisfies P "behaves" like a tr...
210
click to vote
DAGSTUHL
2006
15 years 8 months ago
2006
One of the bottlenecks of current recognition (and graph matching) systems is their assumption of one-to-one feature (node) correspondence. This assumption breaks down in the gener...