Results 1  10
of
3,952
On ffactors in clawfree graphs
 AUSTRALASIAN JOURNAL OF COMBINATORICS VOLUME 52 (2012), PAGES 133–140
, 2012
"... Let G be a 2connected clawfree graph such that δ(G) ≥ 5. Then for every function f: V (G) →{1, 2}, where ∑ x∈V (G) f(x) is even, G has an ffactor. ..."
Abstract
 Add to MetaCart
Let G be a 2connected clawfree graph such that δ(G) ≥ 5. Then for every function f: V (G) →{1, 2}, where ∑ x∈V (G) f(x) is even, G has an ffactor.
Spanning eulerian subgraphs in N²locally connected clawfree graphs
, 2004
"... A graph G is N mlocally connected if for every vertex v in G, the vertices not equal to v and with distance at most m to v induce a connected subgraph in G. We show that both connected N²locally connected clawfree graph and 3edgeconnected N²locally connected clawfree graph have connected even ..."
Abstract
 Add to MetaCart
A graph G is N mlocally connected if for every vertex v in G, the vertices not equal to v and with distance at most m to v induce a connected subgraph in G. We show that both connected N²locally connected clawfree graph and 3edgeconnected N²locally connected clawfree graph have connected
On Factors of 4Connected ClawFree Graphs
 J. GRAPH THEORY
, 1999
"... We consider the existence of several different kinds of factors in 4connected clawfree graphs. This is motivated by the following two conjectures which are in fact equivalent by a recent result of the third author. Conjecture 1 (Thomassen): Every 4connected line graph is hamiltonian, i.e. has ..."
Abstract

Cited by 13 (3 self)
 Add to MetaCart
We consider the existence of several different kinds of factors in 4connected clawfree graphs. This is motivated by the following two conjectures which are in fact equivalent by a recent result of the third author. Conjecture 1 (Thomassen): Every 4connected line graph is hamiltonian, i.e. has
ClawFree Graphs  a Survey.
, 1996
"... In this paper we summarize known results on clawfree graphs. The paper is subdivided into the following chapters and sections: 1. Introduction 2. Paths, cycles, hamiltonicity a) Preliminaries b) Degree and neighborhood conditions c) Local connectivity conditions d) Further forbidden subgraph ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
In this paper we summarize known results on clawfree graphs. The paper is subdivided into the following chapters and sections: 1. Introduction 2. Paths, cycles, hamiltonicity a) Preliminaries b) Degree and neighborhood conditions c) Local connectivity conditions d) Further forbidden
High dimensional graphs and variable selection with the Lasso
 ANNALS OF STATISTICS
, 2006
"... The pattern of zero entries in the inverse covariance matrix of a multivariate normal distribution corresponds to conditional independence restrictions between variables. Covariance selection aims at estimating those structural zeros from data. We show that neighborhood selection with the Lasso is a ..."
Abstract

Cited by 736 (22 self)
 Add to MetaCart
joining some distinct connectivity components of the graph, consistent estimation for sparse graphs is achieved (with exponential rates), even when the number of variables grows as the number of observations raised to an arbitrary power.
A Digital Signature Scheme Secure Against Adaptive ChosenMessage Attacks
, 1995
"... We present a digital signature scheme based on the computational diculty of integer factorization. The scheme possesses the novel property of being robust against an adaptive chosenmessage attack: an adversary who receives signatures for messages of his choice (where each message may be chosen in a ..."
Abstract

Cited by 959 (40 self)
 Add to MetaCart
were considered in the folklore to be contradictory. More generally, we show how to construct a signature scheme with such properties based on the existence of a "clawfree" pair of permutations  a potentially weaker assumption than the intractibility of integer factorization. The new scheme
On Traceability and 2Factors in ClawFree Graphs
, 2002
"... If G is a clawfree graph of sufficiently large order n, satisfying a degree condition oe k ? n + k \Gamma 4k + 7 (where k is an arbitrary constant), then G has a 2factor with at most k \Gamma 1 components. As a second main result, we present classes of graphs C 1 ; : : : ; C 8 such that ever ..."
Abstract
 Add to MetaCart
If G is a clawfree graph of sufficiently large order n, satisfying a degree condition oe k ? n + k \Gamma 4k + 7 (where k is an arbitrary constant), then G has a 2factor with at most k \Gamma 1 components. As a second main result, we present classes of graphs C 1 ; : : : ; C 8
Loopy belief propagation for approximate inference: An empirical study. In:
 Proceedings of Uncertainty in AI,
, 1999
"... Abstract Recently, researchers have demonstrated that "loopy belief propagation" the use of Pearl's polytree algorithm in a Bayesian network with loops can perform well in the context of errorcorrecting codes. The most dramatic instance of this is the near Shannonlimit performanc ..."
Abstract

Cited by 676 (15 self)
 Add to MetaCart
with loops (undirected cycles). The algorithm is an exact inference algorithm for singly connected networks the beliefs converge to the cor rect marginals in a number of iterations equal to the diameter of the graph.1 However, as Pearl noted, the same algorithm will not give the correct beliefs for mul
Motivation through the Design of Work: Test of a Theory. Organizational Behavior and Human Performance,
, 1976
"... A model is proposed that specifies the conditions under which individuals will become internally motivated to perform effectively on their jobs. The model focuses on the interaction among three classes of variables: (a) the psychological states of employees that must be present for internally motiv ..."
Abstract

Cited by 622 (2 self)
 Add to MetaCart
in the management literature, in fact little is known about the reasons why "enriched" work sometimes leads to positive outcomes for workers and for their employing organizations. Even less is known about the relative effectiveness of various strategies for carrying out the redesign of work One reason
Closure and Stable Hamiltonian Properties in ClawFree Graphs
, 1999
"... In the class of kconnected clawfree graphs, we study the stability of some hamiltonian properties under a closure operation introduced by the third author. We prove that (i) the properties of pancyclicity, vertex pancyclicity and cycle extendability are not stable for any k (i.e., for any of these ..."
Abstract

Cited by 16 (3 self)
 Add to MetaCart
In the class of kconnected clawfree graphs, we study the stability of some hamiltonian properties under a closure operation introduced by the third author. We prove that (i) the properties of pancyclicity, vertex pancyclicity and cycle extendability are not stable for any k (i.e., for any
Results 1  10
of
3,952