Marcin Kamiski

Information about the author Marcin Kamiski will soon be added to the site.

Found 3 papers in total

Minimal disconnected cuts in planar graphs

2016

The problem of finding a disconnected cut in a graph is NP‐hard in general but...

The k‐in‐a‐Path Problem for Claw‐free Graphs

2012

The k ‐ in‐a‐Path problem is to test whether a graph contains an...

Vertex 3-colorability of claw-free graphs

2007

The 3-colorability problem is NP-complete in the class of claw-free graphs. In this...

Papers per page: