Oliver Schaudt

activity

20122024

most citedBetter 3-coloring algorithms: excluding a triangle and a seven vertex path

8 citations · 51 across the 26 of their papers we have counts for

collaborators

Showing 2014 · cs.DMShow all

2 papers · 2 filters

cs.DM2014★ 3 cited

A new characterization of $P_{k}$ -free graphs

Eglantine Camby, Oliver Schaudt

The class of graphs that do not contain an induced path on $k$ vertices, $P_{k}$ -free graphs, plays a prominent role in algorithmic graph theory. This motivates the search for specia…

cs.DM2014★ 2 cited

Polynomial time recognition of squares of ptolemaic graphs and 3-sun-free split graphs

Van Bang Le, Andrea Oversberg, Oliver Schaudt

The square of a graph $G$ , denoted $G^{2}$ , is obtained from $G$ by putting an edge between two distinct vertices whenever their distance is two. Then $G$ is called a square root of…

A new characterization of Pk​-free graphs

Polynomial time recognition of squares of ptolemaic graphs and 3-sun-free split graphs

A new characterization of $P_{k}$ -free graphs