most citedHamiltonian path and Hamiltonian cycle are solvable in polynomial time in graphs of bounded independence number

1 citations · 2 across the 4 of their papers we have counts for

collaborators
Showing cs.CGShow all

2 papers · 1 filter

cs.CG2026

Grounded String Representations of Series-Parallel Graphs without Transitive Edges

Sabine Cornelsen, Jan Kratochvíl, Miriam Münch +3

In a {\em grounded string representation} of a graph there is a horizontal line and each vertex is represented as a simple curve below with one end point on su…

cs.CG2023★ 1 cited

The Parametrized Complexity of the Segment Number

Sabine Cornelsen, Giordano Da Lozzo, Luca Grilli +3

Given a straight-line drawing of a graph, a segment is a maximal set of edges that form a line segment. Given a planar graph , the segment number of is the minimum number of…