Teschner's conjecture on the upper bondage number of critical graphs
Statement
Let be additive and hereditary. A graph is vertex--critical if its vertex domination number with respect to has the criticality property used in the paper, and let denote its upper bondage number and its maximum degree. Teschner's conjecture. For any vertex--critical graph ,
The conjecture is presented as the main outstanding conjecture on the ordinary bondage number when ; its general status is not resolved in the supplied source.
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.