Dominating-cycle conjecture for cubic graphs with 4-connected matching contractions
Statement
Let be a cubic graph with a perfect matching such that is -connected. A cycle dominates if it contains at least one endpoint of every edge of . Dominating-cycle conjecture. The graph contains a cycle that dominates . This conjecture is equivalent to the Dominating Cycle Conjecture, which asserts that every cyclically -edge-connected cubic graph has a dominating cycle; the supplied text gives no resolution.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.