2 papers
math.CO2025
Claw-free bricks that every -invariant edge is solitary
Yipei Zhang, Xiumei Wang
A graph is a brick if it is 3-connected and has a perfect matching for any two distinct vertices and of . Lucchesi and Murty proposed a problem concernin…
math.CO2025
Solid bricks that every -invariant edge is solitary
Yipei Zhang, Xiumei Wang
A graph is a brick if it is 3-connected and has a perfect matching for any two distinct vertices and of . A brick is solid if for any two vertex disj…