260 search results - page 20 / 52 » Degree constrained subgraphs |
COMBINATORICS
2006
14 years 10 months ago
2006
An H-factor of a graph G is a spanning subgraph of G whose connected components are isomorphic to H. Given a properly edge-colored graph G, a rainbow H-subgraph of G is an H-subgr...
SODA
2008
ACM
14 years 11 months ago
2008
ACM
Let H be a finite family of graphs. A graph G is H-universal if it contains a copy of each H H as a subgraph. Let H(k, n) denote the family of graphs on n vertices with maximum d...
102
click to vote
DM
2010
14 years 10 months ago
2010
Let Mad(G) denote the maximum average degree (over all subgraphs) of G and let i(G) denote the injective chromatic number of G. We prove that if Mad(G) 5 2 , then i(G) + 1; sim...
COMBINATORICS
2006
14 years 10 months ago
2006
A set M of edges of a graph G is a matching if no two edges in M are incident to the same vertex. The matching number of G is the maximum cardinality of a matching of G. A set S o...
IROS
2007
IEEE
15 years 4 months ago
2007
IEEE
— We explore global randomized joint space path planning for articulated robots that are subject to task space constraints. This paper describes a representation of constrained m...