Mutual-visibility conjecture for distance-hereditary graphs
Statement
Let be a distance-hereditary graph. A big- cograph without universal vertices is a cograph of the form without universal vertices, as described in the preceding characterization. Mutual-visibility conjecture. If is a distance-hereditary graph but not a big- cograph without universal vertices, then
This conjecture seeks to characterize the distance-hereditary graphs for which the mutual-visibility number exceeds the total mutual-visibility number, extending the established classification for cographs. The supplied text gives no resolution status beyond the conjectural formulation.
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.