686 search results - page 50 / 138 » Packing Cycles in Graphs |
110
Voted
FCT
2009
Springer
15 years 7 months ago
2009
Springer
Entanglement is a complexity measure for directed graphs that was used to show that the variable hierarchy of the propositional modal µ-calculus is strict. While graphs of entangl...
119
Voted
SODA
2012
ACM
13 years 2 months ago
2012
ACM
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...
86
Voted
ARSCOM
2004
15 years 10 days ago
2004
We show that every hamiltonian claw-free graph with a vertex x of degree d(x) 7 has a 2-factor consisting of exactly two cycles.
80
Voted
DM
2002
15 years 8 days ago
2002
It is shown that in a 4-connected maximal planar graph there is for any four vertices a, b, c and d, a cycle in the graph that contains the four vertices and visits them in the or...
109
click to vote
ICTAI
2006
IEEE
15 years 6 months ago
2006
IEEE
We propose a formulation of a general-sum bimatrix game as a bipartite directed graph with the objective of establishing a correspondence between the set of the relevant structure...