One or Two Disjoint Circuits Cover Independent Edges: Lovász-Woodall Conjecture

  title={One or Two Disjoint Circuits Cover Independent Edges: Lov{\'a}sz-Woodall Conjecture},
  author={Ken-ichi Kawarabayashi},
  journal={J. Comb. Theory, Ser. B},
In this paper, we prove the following theorem: Let L be a set of k independent edges in a k-connected graph G. If k is even or G?L is connected, then there exist one or two disjoint circuits containing all the edges in L. This theorem is the first step in the proof of the conjecture of L. Lovasz (1974, Period. Math. Hungar., 82) and D. R. Woodall (1977, J. Combin. Theory Ser. B22, 274?278). In addition, we give the outline of the proof of the conjecture and refer to the forthcoming papers. 

An Improved Algorithm for Finding Cycles Through Elements

We consider the following problem: Given k independent edges in G. Is there a polynomial time algorithm to decide whether or not G has a cycle through all of these edges ? If the answer is yes,

Clique or hole in claw-free graphs

Matchings, factors and cycles in graphs

A matching in a graph is a set of pairwise nonadjacent edges, a k-factor is a k-regular spanning subgraph, and a cycle is a closed path. This thesis has two parts. In Part I (by far the larger part)

Spanning Circuits in Regular Matroids

It is proved that Minimum Spanning Circuit parameterized by |T| is W[1]-hard even on cographic matroids, a proper subclass of regular matroIDS.

Cycle Traversability for Claw-Free Graphs and Polyhedral Maps

The result is best possible in the sense that the polyhedral embedding assumption is necessary, and there are infinitely many graphs polyhedrally embedded in surfaces having no cycle containing a certain set of four vertices but avoiding a fifth specified vertex.

M-alternating Hamilton paths and M-alternating Hamilton cycles

Algorithmic and structural aspects of graph partitioning and related problems

This thesis investigates the inapproximability and complexity of the problems of finding the minimum number of monochromatic cliques and rainbow cycles that, respectively, partition V (G), and develops approximation algorithms and on-line algorithms for injective coloring problems, to be defined later.

Directed Hamilton Cycles in Digraphs and Matching Alternating Hamilton Cycles in Bipartite Graphs

In this paper, it is proved that the conclusions of Woodall's Ore-type condition for directed Hamilton cycles in digraphs still hold, with only a few exceptional cases that can be clearly characterized.

Circuits through prescribed edges

We prove that a connected graph G contains a circuit—a closed walk that repeats no edges—through any k prescribed edges if and only if G contains no odd cut of size at most k .



Any four independent edges of a 4-connected graph are contained in a circuit

Conjecture. Suppose G is a k-connected graph (k=>2), el, e~ . . . . , ekEE(G) are independent edges, and if k is odd then G {el, e2, ..., ek} is connected. Then G contains a circuit using all the

Circuits through specified edges

Cycles through specified vertices of a graph

It is proved that ifS is a set ofk−1 vertices in ak-connected graphG, then the cycles throughS generate the cycle space ofG, and the existence of odd and even cycles through specified vertices is established.

Cycles intersecting a prescribed vertex set

It is shown that for r = 1 or 2 every n-connected graph satisfies P(n + r,n), and if n ⩾ max{3,(2r −1)(r + 1)}, then every n -connectedgraph satisfies P (n +r,n).

On circuits through five edges

The binding number of a graph and its Anderson number

Cycles Through Prescribed and Forbidden Point Sets

Note on circuits containing specified edges

Circuits containing specified edges