Graph-Theoretic Concepts in Computer Science

DOI10.1007/b93953zbMath1255.05188MaRDI QIDQ5902531

Haiko Müller, Ioan Todinca, Dieter Kratsch

Publication date: 12 January 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (10)

Lower and upper bounds for long induced paths in 3-connected planar graphs ⋮ New upper bounds on feedback vertex numbers in butterflies ⋮ Mim-width. I. Induced path problems ⋮ New formulations and branch-and-cut procedures for the longest induced path problem ⋮ MIP formulations for induced graph optimization problems: a tutorial ⋮ Contracting to a longest path in H-free graphs ⋮ Minimum weight feedback vertex sets in circle graphs ⋮ An improved algorithm for the longest induced path problem on \(k\)-chordal graphs ⋮ Unnamed Item ⋮ Induced disjoint paths in AT-free graphs

This page was built for publication: Graph-Theoretic Concepts in Computer Science