3008 search results - page 97 / 602 » Independence in connected graphs |
128
click to vote
EJC
2007
15 years 6 months ago
2007
It was conjectured by Thomassen ([B. Alspach, C. Godsil, Cycle in graphs, Ann. Discrete Math. 27 (1985)], p. 466) that every longest circuit of a 3-connected graph must have a cho...
145
click to vote
DM
2006
15 years 6 months ago
2006
Let G be a connected, locally connected, claw-free graph of order n and x, y be two vertices of G. In this paper, we prove that if for any 2-cut S of G, S {x, y} = , then each (x...
191
click to vote
ICALP
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. We present an expected polynomial time algorithm to generate a labeled planar graph uniformly at random. To generate the planar graphs, we derive recurrence formulas that...
183
click to vote
EJC
2010
15 years 6 months ago
2010
Let G be a simple connected graph with n vertices and n edges which we call an unicyclic graph. In this paper, we first investigate the least eigenvalue n(G), then we present two ...
186
click to vote
IJAR
2010
15 years 4 months ago
2010
The logical and algorithmic properties of stable conditional independence (CI) as an alternative structural representation of conditional independence information are investigated...