Polynomial-time recognition of relating edges in graphs with no 6-cycles
Statement
Let be a graph in , and let be an edge. The edge is called relating when it has the relating-edge property used in the paper.
Relating-edge recognition conjecture. The following problem is polynomially solvable: given a graph and an edge , determine whether is relating.
The conjecture is proposed as a common generalization of the paper's polynomial results for related graph classes. Its resolution is not given in the supplied text.
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.