Showing cs.DMShow all
2 papers · 1 filter
cs.DM2026
Clique-width and induced topological minors
PaweÅ RafaÅ BieliÅski, Jadwiga Czyżewska, Martin MilaniÄ +2
A is a chordless path on four vertices. A diamond is a graph obtained from a clique of size four by removing one edge of the clique. A paw is a graph obtained from a clique o…
cs.DM2026
The Gallai Vertex Problem is -Complete
Amir Nikabadi, Eva Rotenberg, Lasse Wulf
When a graph admits a vertex that is contained in all its longest paths, we call a Gallai vertex. These are named after Gallai, who in 1966 asked the question if it is…