scientific article; zbMATH DE number 6257563

zbMath1281.68124MaRDI QIDQ5747399

Daniël Paulusma, Jiří Fiala, Marcin Kaminski

Publication date: 14 February 2014

Full work available at URL: https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/2128/0.html

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

claw-free graphcontractibilitycontainment relation

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph operations (line graphs, products, etc.) (05C76)

Related Items (11)

Detecting induced minors in AT-free graphs ⋮ Disconnected cuts in claw-free graphs ⋮ The complexity of contracting bipartite graphs into small cycles ⋮ Unnamed Item ⋮ Path Contraction Faster than $2^n$ ⋮ Contracting to a longest path in H-free graphs ⋮ Detecting fixed patterns in chordal graphs in polynomial time ⋮ Induced Disjoint Paths in Claw-Free Graphs ⋮ Contracting bipartite graphs to paths and cycles ⋮ Contracting bipartite graphs to paths and cycles ⋮ Path Contraction Faster Than 2^n

This page was built for publication: