1952 search results - page 18 / 391 » Complete partitions of graphs |
WG
2009
Springer
14 years 2 months ago
2009
Springer
ICML
2004
IEEE
14 years 8 months ago
2004
IEEE
A critical problem in cluster ensemble research is how to combine multiple clusterings to yield a final superior clustering result. Leveraging advanced graph partitioning techniqu...
COMBINATORICS
2002
13 years 7 months ago
2002
Erdos, Rubin, and Taylor found a nice correspondence between the minimum order of a complete bipartite graph that is not r-choosable and the minimum number of edges in an r-unifor...
JGT
2008
13 years 7 months ago
2008
We determine necessary and sufficient conditions for a complete multipartite graph to admit a set of 1-factors whose union is the whole graph and, when these conditions are satisf...
JGT
2006
13 years 7 months ago
2006
: A graph has the neighbor-closed-co-neighbor, or ncc property, if for each of its vertices x, the subgraph induced by the neighbor set of x is isomorphic to the subgraph induced b...